摘要
Dijkstra算法是最经典的最短路径算法,A-star算法是最有前景的启发式搜索算法。深入分析和比较两种算法,在复杂的交通地形图中,通过改进估价函数,证实了A-star算法在智能导航中更加高效。
Dijkstra algorithm is the most classic shortest path algorithm and A-star algorithm is the most potential heuristic search algorithm. This paper deeply analyzes and compares the two algorithms. The results show that A-star algorithm is more effective with intelligent guiding for improving evaluation function in complicated traffic relief maps.
出处
《重庆科技学院学报（自然科学版）》
CAS
2010年第6期159-161,共3页
Journal of Chongqing University of Science and Technology：Natural Sciences Edition
