车载导航系统最优路径搜索算法研究

Shaanxi Institute of International Trade&Commerce

随着交通运输行业的不断发展,车载导航技术也在不断进步。通过车载导航系统的路径规划与引导功能,可以有效帮助用户减少出行时间,提高出行效率。路径规划问题是车载导航系统的核心,一个好的规划算法可以帮助用户规划出最优路径,因此有必要对导航系统的路径规划进行研究。车载导航系统使用的算法主要是Dijkstra算法和A*算法,由于算法本身的局限性,很难直接应用于导航系统,需要进行改进和优化。

With the continuous development of transportation industry,navigation technology is also in progress.Through the vehicle navigation system of path planning and guidance function,can effectively help users reduce the travel time,improve the efficiency of travel.Path planning problem is the core of the vehicle navigation system,a good can help users planning out the optimal path planning algorithm,it is necessary to study of navigation path planning.Vehicle navigation system using the algorithm mainly Dijkstra algorithm and A＊ algorithm,due to the limitations of the algorithm itself,it is difficult to directly applied to the navigation system,needs to be improved and optimized.