Improvement and Realization of Beeline Optimizing A~* Algorithm in Shortest Path Problem
Xianzhong Zhou · Journal of Engineering Graphics · 2009
The efficiency of shortest path algorithm brings wide attention and needs to be solved urgently in real-time auto navigation and dynamic route programming.The optimization means based on the classical Dijkstra’s algorithm is analyzed,and then the improvement of algorithm is presented from two aspects:bucket-sort structure and beeline optimizing A* algorithm with heuristic gene.Experiment results show that the algorithm is stable and effective.