Path Planning for Intelligent Parking Garages Based on Improved A* Algorithm

For solving some problems of the traditional A* algorithm-based path planned for AGV (automated guided vehicle), This paper proposes an improved A* algorithm. Initially, through optimizing the process of selecting child nodes, the problem of vertex collision is avoided. Additionally, the heuristic function of the A* algorithm is optimized by incorporating a turning coefficient, which reduces the number of turns in the process of path planning. Furthermore, the Floyd algorithm is introduced to enhance the smoothness of the overall path. The simulation results show that the improved A* algorithm successfully avoids vertex collision, requires fewer turns, and makes overall path smoother.