Study on the Application of A* Shortest Path Search Algorithm in Dynamic Urban Traffic

This paper studies the application of A* shortest path search algorithm in dynamic urban traffic in the search of optimal path in real-time and dynamic traffic environment. At first, this paper introduces A* search algorithm and the characteristics of urban traffic. Then, the A* search algorithm application processes in optimal path searching of urban traffic is analyzed. The analysis focuses on the heuristic function of A* search algorithm. In the course of algorithm design, not only are the accuracy of the prediction of travel time and the characteristics of urban traffic considered, but also the factor of time similarity in urban traffic is taken into account.