Research on global path planning for driverless vehicles based on improved A* algorithm

The global path planning of driverless vehicles is one of the key technologies in the research of driverless vehicles. This article studies the disadvantages of the A* algorithm in the application of global path planning. The slow search and judgment of the final path node by the A* algorithm is due to the algorithm's exploration and judgment of all eight nodes around each exploration node, resulting in a large amount of unnecessary calculations. Therefore, it is proposed to combine the JPS algorithm with the A* algorithm, Improve the problem of slow searching for final path nodes and long running time in the A* algorithm. The article replaces the exploration node part of the A* algorithm with the skip search method of the JPS algorithm, which greatly reduces unnecessary calculations. Through Matlab simulation experiments, the running time before and after the algorithm improvement is compared. The results show that the A * algorithm combined with the skip search method of the JPS algorithm significantly reduces search nodes, reduces algorithm running time, and optimizes algorithm efficiency.