现代电子技术2017，Vol.40Issue(13)：181-183,186,4.DOI:10.16652/j.issn.1004-373x.2017.13.048
基于路径优化的A*算法与Dijkstra算法的性能比较
Performance comparison between A* algorithm and Dijkstra algorithm based on path optimization
摘要
Abstract
The path optimization is an important way to solve the traffic congestion and blocking. The traditional Dijkstra al-gorithm based on monophyletic shortest path can find the shortest path information from the starting point to other points,but its search time is long in the situation of various map obstacles. The A* algorithm with heuristic function in the field of artificial in-telligence can select the optimum path by itself because of its memory function. With the increase of obstacle information and lo-cation information,the search efficiency of A* algorithm becomes higher. The A* algorithm and traditional Dijkstra algorithm were simulated and compared with experiments,and their search speed and search efficiency were compared. The simulation re-sults show that the search effect of A* algorithm is more effective in the actual road network.关键词
最短路径/A*算法/Dijkstra算法/路径优化Key words
shortest path/A* algorithm/Dijkstra algorithm/path optimization分类
信息技术与安全科学引用本文复制引用
刘云翔,杜杰,张晴..基于路径优化的A*算法与Dijkstra算法的性能比较[J].现代电子技术,2017,40(13):181-183,186,4.基金项目
国家自然科学基金(61401281) （61401281）
上海市自然科学基金(14ZR1440700) （14ZR1440700）
