摘要
在分析影响地图匹配算法实时性、鲁棒性及匹配精度因素的基础上,依据车辆运动的连续性,引入道路网络的分块思想,并利用车辆行驶的位置、方向信息及实际道路网络的拓扑特性,提出一种时间复杂度为O(c)的快速地图匹配算法.对实际跑车数据的仿真结果表明,该算法的匹配正确率不低于95%,单点匹配时间不超过0.01ms.
Based on analyzing the factors of affecting real-time performance, robustness, and matching precision of the map matching algorithm, and according to the continuity of the vehicle movement, the idea of partitioning the road net into some grids is introduced. Using the information about the position and the direction of the vehicle running and the topological feature of the road network, a quick map matching algorithm, of which the time complexity is (O(c),) is proposed. Simulating results aimed at the practical running data show that the correct rate about the new algorithm is no less than 95% and the matching time for the individual positioning point is less than 0.01 ms.
出处
《北京理工大学学报》
EI
CAS
CSCD
北大核心
2005年第3期225-229,共5页
Transactions of Beijing Institute of Technology
基金
国家部委预研项目(102364)
关键词
车辆导航系统
地图匹配
道路网络分块
vehicle navigation system
map matching
road net partition
