摘要
车辆导航系统的核心是路径规划算法,路径规划算法分静态路径规划(Static Path Planning,SPP)算法和动态路径规划(Dynamic Path Planning,DPP)算法,SPP的不足是不能对实时变化交通信息做出快速响应,而DPP则可以利用路网中实时更新的交通信息及时地为驾驶者提供更佳的导航路线。本文在研究了静态路径规划中用到的一些算法后,如A*算法,继而分析动态路径规划的一些思想,在此基础上分析D*Lite算法可以改进的地方,并给出优化后的算法程序。利用10×10、50×50、100×100三种规模的模拟路网做对比实验,实验表明优化后的D*Lite算法在速度上有了较大提高。
The core of vehicle navigation system is the path planning algorithm, and the path planning algorithm is divided into two types, the SPP（Static Path Planning） and the DPP（Dynamic Path Planning）. The shortage of SPP is that it cannot make quick response to the real-time changing traffic information. And the DPP can provide better route timely for the drivers when the traffic information has been updated. This paper studies some classic algorithms for SPP, like A^＊, then analyzes the thoughts of dynamic path planning algorithms. Based on those, this paper analyzes the D^＊ Lite algorithm and indicates the places that can be optimized, then introduces the procedure of the optimized D^＊ Lite. This paper performs three sets of experiments on the simulate traffic network of size 10×10、50×50、100×100, and the experiments results show that the optimized D^＊ Lite algorithm gets greatly improved in terms of speed.
出处
《微型机与应用》
2015年第7期16-19,共4页
Microcomputer & Its Applications
