论文部分内容阅读
随着交通运输行业的不断发展,车载导航技术也在不断进步。通过车载导航系统的路径规划与引导功能,可以有效帮助用户减少出行时间,提高出行效率。路径规划问题是车载导航系统的核心,一个好的规划算法可以帮助用户规划出最优路径,因此有必要对导航系统的路径规划进行研究。车载导航系统使用的算法主要是Dijkstra算法和A*算法,由于算法本身的局限性,很难直接应用于导航系统,需要进行改进和优化。
With the continuous development of the transportation industry, car navigation technology is also making continuous progress. Through the car navigation system path planning and guidance functions, users can effectively help reduce travel time and improve travel efficiency. The path planning problem is the core of vehicle navigation system. A good planning algorithm can help users to plan the optimal path. Therefore, it is necessary to study the path planning of the navigation system. The algorithms used by car navigation system are mainly Dijkstra algorithm and A * algorithm. Due to the limitations of the algorithm itself, it is difficult to apply the algorithm directly to the navigation system and need to be improved and optimized.