Logistics Robot Path Planning Based on Wide Neighborhood A* Algorithm

In this paper, an improved A* algorithm is proposed to solve the problems of turning points, redundant points and sub-optimal paths in the traditional A* algorithm for logistics robots with known global static obstacles. Firstly, the traditional A* algorithm is expanded from the original 8 neighborhood to 24 neighborhood to expand search range. Secondly, based on the 24 neighborhood A* algorithm, one-way search is improved to two-way search, so as to improve the efficiency of path search. Finally, by extracting the key nodes in the path, the redundant nodes in the path are reduced. Simulation results show that the improved A* algorithm can plan shorter path length, less search time and better path smoothness.