Push, Stop, and Replan: An Application of Pebble Motion on Graphs to Planning in Automated Warehouses

The pebble-motion on graphs is a subcategory of multi-agent pathfinding problems dealing with moving multiple pebble-like objects from a node to a node in a graph with a constraint that only one pebble can occupy one node at a given time. Additionally, algorithms solving this problem assume that individual pebbles (robots) cannot move at the same time and their movement is discrete. These assumptions disqualify them from being directly used in practical applications, although they have otherwise nice theoretical properties. We present modifications of the Push and Rotate algorithm [1], which relax the presumptions mentioned above and demonstrate, through a set of experiments, that the modified algorithm is applicable for planning in automated warehouses.

[1]  Adi Botea,et al.  MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees , 2011, J. Artif. Intell. Res..

[2]  Malcolm Ross Kinsella Ryan.  Exploiting Subgraph Structure in Multi-Robot Path Planning , 2008, J. Artif. Intell. Res..

[3]  Kevin Chiew.  Scheduling and routing of autonomous moving objects on a mesh topology , 2012, Oper. Res..

[4]  Oded Goldreich.  Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard , 2011, Studies in Complexity and Cryptography.

[5]  Michal Cáp,et al.  Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots , 2014, IEEE Transactions on Automation Science and Engineering.

[6]  Adi Botea,et al.  Fast and Memory-Efficient Multi-Agent Pathfinding , 2008, ICAPS.

[7]  David Silver,et al.  Cooperative Pathfinding , 2005, AIIDE.

[8]  Cees Witteveen,et al.  Push and Rotate: a Complete Multi-agent Pathfinding Algorithm , 2014, J. Artif. Intell. Res..

[9]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[10]  Wolfram Burgard,et al.  Optimizing schedules for prioritized path planning of multi-robot systems , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[11]  Thierry Siméon,et al.  Path coordination for multiple mobile robots: a resolution-complete algorithm , 2002, IEEE Trans. Robotics Autom..

[12]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[13]  Kostas E. Bekris,et al.  Efficient and complete centralized multi-robot path planning , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[14]  John McPhee,et al.  A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps , 2008, IEEE Transactions on Robotics.

[15]  Dinesh Manocha,et al.  Centralized path planning for multiple robots: Optimal decoupling into sequential plans , 2009, Robotics: Science and Systems.

[16]  Alborz Geramifard,et al.  Biased Cost Pathfinding , 2006, AIIDE.

[17]  Mark H. Overmars,et al.  Prioritized motion planning for multiple robots , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[18]  Steven M. LaValle,et al.  Optimal motion planning for multiple robots having independent goals , 1998, IEEE Trans. Robotics Autom..

[19]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .