A Collision-Free Path Planning Approach for Multiple Robots Under Warehouse Scenarios

Coordinating the motion of multi-robot is one of the fundamental problems in robotics, and how to find collision-free paths efficiently is an open issue. The high time complexity in existing methods severely hinders the applications of multi-robot in practice, especially in an overloaded warehouse scenario. To overcome this difficulty, we propose a collision-free search algorithm based on Jump point search (JPS) to improve the searching efficiency, where a reverse search path is employed to estimate the distance from the current position of one robot to the target position during traversing the root node. The experimental results show that the proposed method can achieve a higher efficiency compared with the traditional methods.