Towards Using Discrete Multiagent Pathfinding to Address Continuous Problems

Motivated by efficient algorithms for solving combinatorial and discrete instances of the multi-agent pathfinding problem, this report investigates ways to utilize such solutions to solve similar problems in the continuous domain. While a simple discretization of the space which allows the direct application of combinatorial algorithms seems like a straightforward solution, there are additional constraints that such a discretization needs to satisfy in order to be able to provide some form of completeness guarantees in general configuration spaces. This report reviews ideas on how to utilize combinatorial algorithms to solve continuous multiagent pathfinding problems. It aims to collect feedback from the community regarding the importance and the complexity of this challenge, as well as the appropriateness of the solutions considered here.

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

[2]  Nathan R. Sturtevant,et al.  Direction Maps for Cooperative Pathfinding , 2008, AIIDE.

[3]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[4]  Samuel Loyd,et al.  Mathematical Puzzles of Sam Loyd , 1959 .

[5]  Pavel Surynek,et al.  A novel approach to path planning for multiple robots in bi-connected graphs , 2009, 2009 IEEE International Conference on Robotics and Automation.

[6]  Madhu Sudan,et al.  Motion planning on a graph , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Nathan R. Sturtevant,et al.  A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding , 2011, SOCS.

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

[9]  Nathan R. Sturtevant,et al.  Improving Collaborative Pathfinding Using Map Abstraction , 2006, AIIDE.

[10]  Mitul Saha,et al.  Multi-Robot Motion Planning by Incremental Coordination , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Mark H. Overmars,et al.  High quality navigation in computer games , 2007, Sci. Comput. Program..

[12]  Jean-Claude Latombe,et al.  A general framework for assembly planning: the motion space approach , 1998, SCG '98.

[13]  Paul G. Spirakis,et al.  Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications , 2015, FOCS.

[14]  Raffaello D'Andrea,et al.  Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses , 2007, AI Mag..

[15]  Ellips Masehian,et al.  Solvability of multi robot motion planning problems on Trees , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

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

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

[19]  Trevor Scott Standley.  Finding Optimal Solutions to Cooperative Pathfinding Problems , 2010, AAAI.

[20]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[21]  Manfred K. Warmuth,et al.  Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable , 1986, AAAI.

[22]  Richard E. Korf,et al.  Complete Algorithms for Cooperative Pathfinding Problems , 2011, IJCAI.

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

[24]  Mimmo Parente,et al.  A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees , 1996, SWAT.

[25]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 2005, Algorithmica.

[26]  Ellips Masehian,et al.  A hierarchical decoupled approach for multi robot motion planning on trees , 2010, 2010 IEEE International Conference on Robotics and Automation.

[27]  Nancy M. Amato,et al.  Disassembly sequencing using a motion planning approach , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[28]  Roni Stern,et al.  The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding , 2011, IJCAI.

[29]  Wolfram Burgard,et al.  Finding and Optimizing Solvable Priority Schemes for Decoupled Path Planning Techniques for Teams of Mobile Robots , 2002, PuK.

[30]  Peter Stone,et al.  A Multiagent Approach to Autonomous Intersection Management , 2008, J. Artif. Intell. Res..

[31]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .

[32]  Kostas E. Bekris,et al.  Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees , 2011, IJCAI.

[33]  Jürgen Leitner,et al.  Multi-robot Cooperation in Space: A Survey , 2009, 2009 Advanced Technologies for Enhanced Quality of Life.

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