针对简化路网的基于序列的双向合并地图匹配算法

Study on Map-matching Algorithm for simplified road network

简化路网具有结构简单、算法运行速度快的特点,对地图匹配算法的基础研究具有应用价值。本文针对简化路网的GPS轨迹数据地图匹配问题提出了一种基于序列的双向合并算法。实验结果表明:本算法不仅具有较好的匹配度,还优于现有的Passby算法和增量算法,并且在匹配过程中解决了遗漏路段和极值等错误问题。所以,本算法对于实际路网的地图匹配具有较好的借鉴作用。

The simplified road network has a simple structure and the algorithm running on it will be high efficiency, so it has a promoted effect on the basic research of map matching algorithm. This paper proposes a sequence - based bidirectional merge algorithm for map matching of GPS trajectoryin simplified road network. The experimental results show that the proposed algorithm in this paper not only have a well matching confidence, but also perform better than Passby algorithm and incremental algorithm, during the procedure of merging, the algorithm would address the problems of skipping segment and outhers. So, this algorithm has a better reference function for the map matching of the actual road network.