An Automated Guided Vehicle Path Planning Algorithm Based on Improved A* and Dynamic Window Approach Fusion

Abstract

Aimed at the problems of low search efficiency of the A* algorithm in global path planning, not considering the size of AGV and too many turns, and the DWA algorithm easily falling into local optimization, an AGV path planning algorithm based on improved A* and DWA fusion is proposed. To begin, the obstacle rate coefficient is added to the A* algorithm’s evaluation function to build an adaptive cost function; the search efficiency and path safety are increased by improving the search mode; by extracting key nodes, a global path containing only the starting point, key nodes, and endpoints is obtained. The DWA algorithm’s evaluation function is then optimized and the starting azimuth is optimized based on information from the first key node. The experimental results show that in a static environment, compared with the traditional A* algorithm and the improved A* algorithm, the path length is reduced by 1.3% and 5.6%, respectively, and the turning times are reduced by 62.5% and 70%, respectively; compared with the improved ant colony algorithm in the literature, the turning angle is reduced by 29%. In the dynamic environment, the running time of this fusion algorithm is reduced by 12.6% compared with the other hybrid algorithms.

Multi-Automated Guided Vehicles Conflict-Free Path Planning for Packaging Workshop Based on Grid Time Windows

“…2024, 14, 3341 2 of 15 A* algorithm with the DWA algorithm to reduce the AGV travel distance and improve transportation efficiency. Hole [13] used the weighted Manhattan distance as the heuristic function, reduced the number of nodes traversed by the A* algorithm, added the turning cost parameter, and improved the smoothness of the path.…”