摘要
针对车辆定位与导航系统中的最优路径规划问题 ,研究了最短路径搜索算法的快速实现技术 ,并提出了一种启发式快速最优路径规划算法 .在分析经典迪杰斯特拉最短路径搜索算法的最优实现的基础上 ,引入基数堆结构缩减了算法的时间复杂度 ,再利用启发式搜索和地图分级搜索技术减小搜索空间 ,从而获得最短路径规划算法的高效率实现 .
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.
出处
《北京航空航天大学学报》
EI
CAS
CSCD
北大核心
2002年第1期70-73,共4页
Journal of Beijing University of Aeronautics and Astronautics
关键词
车辆地面导航系统
启动式搜索
路径规划
优化
算法
vehicular ground navigation system
shortest path
data structure
radix heap
heuristic search
