Research on robot path planning algorithm in modern automatic storage environment based on improved A* algorithm

Abstract

In order to improve the efficiency of robot path planning in the storage environment, this study improved the A* algorithm based on the warehouse environment. In this paper, the heuristic function of the A* algorithm is optimized based on the map of the simulated warehouse environment, and the robot path planning simulations of single target point and multiple target points are carried out respectively. To evaluate the improvement of algorithm we improved on the path planning speed of the mobile robot, this study compared the performance of the improved algorithm on the path planning ability of the mobile robot with the Dijkstra path planning algorithm, the A* algorithm and the improved A* algorithm based on dynamically weighted. The results show that the improved A* algorithm based on Manhattan distance achieves optimal results in terms of computational speed, with 99.8% improvement over Dijkstra's algorithm, 98.8% improvement over the traditional A* algorithm, and 94.87% improvement over the A* algorithm based on dynamically weighted heuristic functions. The algorithm in this paper can provide support for the study of path planning of robots in automatic storage environment.