Fast Route Planning Algorithm for Vehicle Location and Navigation Systems
-
摘要: 针对车辆定位与导航系统中的最优路径规划问题,研究了最短路径搜索算法的快速实现技术,并提出了一种启发式快速最优路径规划算法.在分析经典迪杰斯特拉最短路径搜索算法的最优实现的基础上,引入基数堆结构缩减了算法的时间复杂度,再利用启发式搜索和地图分级搜索技术减小搜索空间,从而获得最短路径规划算法的高效率实现.仿真试验的结果证明了该算法的优异性能.Abstract: Route planning is widely recognized to be a critical issue in the field of vehicle navigation. By examining fast route planning algorithms used in vehicle location and navigation systems,a high-efficient implementation method of shortest-path searching algorithm was proposed in this paper,which is realized by utilizing radix heap structure,heuristic searching algorithm,and hierarchical searching method based on multiple layer map structure synthetically. Simulation results showed that,by introducing this algorithm,the time consumption of route planning can be reduced significantly.
-
Key words:
- vehicular ground navigation system /
- shortest path /
- data structure /
- radix heap /
- heuristic search
-
[1] 赵亦林(美). 车辆定位与导航系统[M]. 谭国真译. 北京:电子工业出版社,1999. 110~132. [2]Dijkstra E W. A note on two problems in connexion with graphs[J]. Numberische Mathematik,1959,1(1):269~271. [3]Zhan F B. Three fastest shortest path algorithms on real road networks. Journal of Geographic Information and Decision Analysis,1997,1(1):69~82. [4]Ahuja R K,Mehlhorn K, Orlin J B,et al. Faster algorithms for the shortest path problem[J]. Journal of the Association for Computing Machinery,1990,37(2):213~223. [5]HartPE,Nilsson N J,Raphael B. A formal basis for the heuristic determination of minimum cost paths[J]. IEEE Transaction of System Science and Cybernetics,1968,4(2):100~107. [6]严蔚敏,吴伟民. 数据结构[M]. 北京:清华大学出版社,1997. -
点击查看大图
计量
- 文章访问数: 3324
- HTML全文浏览量: 195
- PDF下载量: 863
- 被引次数: 0
下载:
