Research on AGV Trolley Path Optimization Based on Improved A ⋆ Algorithm

In the field of industrial manufacturing, the running time and search execution efficiency of AGV trolleys are critical to production efficiency. In order to improve production efficiency, many researchers are working to optimize the driving route of AGV trolleys. Traditional path planning algorithms such as Breadth-First (BFS), Dijkstra, Ant Colony and A ⋆ have been widely used[1] [3]. Among them, the A ⋆ algorithm is favored because of its high efficiency and low time and space complexity. However, the A ⋆ algorithm often faces the problems of too large turning angle and un smooth path when dealing with path planning. In order to solve these problems, this paper proposes an A ⋆ algorithm combined with Bezier curve. The simulation results show that the improved algorithm is superior to the traditional A ⋆ algorithm in terms of driving distance, searching for the optimal path scheme and time planning, and the generated path has higher application value. This shows that the optimized A ⋆ algorithm has significant advantages in the path planning of industrial AGV trolleys[2] [11].