Dijkstra and A* algorithms in automated vehicle driving

Path planning technology is one of the current hotspots of research in many intelligent technology fields, which has a broad application prospect and research value. With the rapid improvement of computer arithmetic power and the widespread popularization of automation, automatic driving has gradually become a hot topic of people's attention. Among them, path planning algorithms play a central role in the field of automatic driving. In this paper, firstly, it will summarize and introduce the development history and basic principles of the two basic path algorithms, Dijkstra algorithm and A* algorithm, list the advantages and disadvantages of these two path planning methods based on graph search and the application scenarios, and then analyze and compare Dijkstra algorithm and A* algorithm, discuss their advantages and disadvantages in the field of intelligent driving, and finally make an outlook of future development directions of the path planning technology in the field of intelligent driving. The research in this paper will provide certain reference value to the researchers of path planning algorithms for intelligent vehicles. It will be of great value to the research and application of new path planning algorithms based on Dijkstra and A* algorithms in the future.