Real-Time Obstacle Avoidance Path Planning Method for AGVs Integrating Improved A* Algorithm, DWA and Key Point Extraction

The A* algorithm is widely used in path planning for Automated Guided Vehicles (AGVs), but the path it generates is prone to collision with random obstacles. To address this issue, this paper proposes a hybrid path planning algorithm integrating the improved A* algorithm with Dynamic Window Approach (DWA). Firstly, a global key point extraction strategy is adopted, and Bresenham’s line algorithm is used to eliminate redundant path points and turning inflection points, optimizing the conciseness and continuity of the path while redefining the child nodes of the current position. Secondly, in complex environments, the inflection points of the global path are taken as the target points of DWA to segment the path, and local dynamic planning is combined to achieve real-time obstacle avoidance. Simulation results show that compared with the traditional A* algorithm, the improved algorithm reduces the planning time by 24.19%, decreases the number of inflection points by 40.00%, and shortens the path length by 1.49%. In environments with random obstacles, the path generated by the hybrid algorithm is smoother, which can effectively enhance the local obstacle avoidance capability and improve the safety of path planning. Furthermore, physical experiments on an AGV platform with a distributed master-slave control architecture (STM32 microcontroller and Jetson embedded processor) verify the algorithm’s hardware compatibility and real-time computing performance, validating its engineering applicability in practical industrial scenarios.