| 基于路网拓扑结构的无方向参数地图匹配算法 |
| |
| 引用本文： | 周璞,刘卫宁,孙棣华. 基于路网拓扑结构的无方向参数地图匹配算法[J]. 计算机工程与应用, 2006, 42(33): 188-190 |
| |
| 作者姓名： | 周璞 刘卫宁 孙棣华 |
| |
| 作者单位： | 重庆大学,计算机学院,重庆,400044;重庆大学,自动化学院,重庆,400044 |
| |
| 摘 要： | 利用车辆行驶的连续性,将比较车辆行驶轨迹与地图道路相似性的问题转化为在多组候选道路中选择一条连续的,可能性最大的道路作为匹配结果。充分利用了网络拓扑结构和车辆必定经过确定道路的特性,对不可能的待匹配道路进行剪枝,减小了计算量。此外,在匹配过程中不需要方向参数,算法适用面较广。
|
| 关 键 词： | 车辆定位 GPS 地图匹配 拓扑结构 |
| 文章编号： | 1002-8331（2006）33-0188-03 |
| 收稿时间： | 2006-02-01 |
| 修稿时间： | 2006-02-01 |
Map-Matching Algorithm Based on Road Network Topological Structure without Direction Parameter |
| |
| ZHOU Pu,LIU Wei-ning,SUN Di-hua. Map-Matching Algorithm Based on Road Network Topological Structure without Direction Parameter[J]. Computer Engineering and Applications, 2006, 42(33): 188-190 |
| |
| Authors: | ZHOU Pu LIU Wei-ning SUN Di-hua |
| |
| Affiliation: | 1.College of Computer Science, Chongqing University, Chongqing 400044, China; 2.College of Automation,Chongqing University,Chongqing 400044,China |
| |
| Abstract: | Based on the continuity of vehicle's track,a map matching algorithm is suggested,which regards the continuing routine with maximum possibility as a matched result from multiple candidates.It prunes the impossible candidate set to minish the computing load,which maturely makes use of road network topological structure and the characteristic that the vehicle would definitely traverse the determinate routine.Furthermore,this algorithm can be more widely applied,because no direction parameter is needed in the procedure of matching. |
| |
| Keywords: | GPS |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
