Research on AGV Intelligent Parking Navigation Path Planning Based on A☆ Algorithm

In this paper, for the AGV navigation path planning algorithm design problems, explored and researched the idea and implementation process of the A(star) algorithm, constructed the experimental environment model of AGV navigation path planning by using grid graphs, and carried out experiments with the help of simulation tools to verify the impact of different neighborhood node expansion search methods on the path planning speed in the A(star) algorithm. From the experimental data comparison and analysis results, it is concluded that the node expansion search method plays a key role in the efficiency of path planning. The results of the exploration research will provide a certain reference basis for the correct selection of node neighborhood expansion search method for AGV navigation route path planning in the actual production environment.