AGV Path Planning based on Improved Dijkstra Algorithm
Yinghui Sun, Ming Fang, Yixin Su
Abstract
Abstract Aiming at the path planning problem of Automated Guided Vehicle (AGV) in intelligent storage, an improved Dijkstra algorithm that combines eight-angle search method and Dijkstra algorithm for path optimization is proposed. The grid method is used to model the storage environment, and the improved Dijkstra algorithm is used to optimize the route of the AGV. The simulation test of the AGV path planning process with Matlab shows that the AGV can effectively avoid obstacles by using the traditional Dijkstra algorithm and the improved Dijkstra algorithm, and then search for a collision-free optimized path from the start point to the end point; and the traditional Dijkstra algorithm In comparison, the path length planned by the improved Dijkstra algorithm is shorter and the turning angle is less, indicating that the improved algorithm is correct, feasible and effective, and has a strong global search ability.