Performance comparison between A* algorithm and Dijkstra algorithm based on path optimization
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.
国家科技期刊平台
NSTL
万方数据
维普
