Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering

We introduce multi-goal multi agent path finding (MAPF$^{MG}$) which generalizes the standard discrete multi-agent path finding (MAPF) problem. While the task in MAPF is to navigate agents in an undirected graph from their starting vertices to one individual goal vertex per agent, MAPF$^{MG}$ assigns each agent multiple goal vertices and the task is to visit each of them at least once. Solving MAPF$^{MG}$ not only requires finding collision free paths for individual agents but also determining the order of visiting agent's goal vertices so that common objectives like the sum-of-costs are optimized. We suggest two novel algorithms using different paradigms to address MAPF$^{MG}$: a heuristic search-based search algorithm called Hamiltonian-CBS (HCBS) and a compilation-based algorithm built using the SMT paradigm, called SMT-Hamiltonian-CBS (SMT-HCBS). Experimental comparison suggests limitations of compilation-based approach.

[1]  Nathan R. Sturtevant,et al.  Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges , 2021, SOCS.

[2]  William Rand,et al.  Design Guidelines for Agent Based Model Visualization , 2009, J. Artif. Soc. Soc. Simul..

[3]  Sven Koenig,et al.  Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks , 2017, AAMAS.

[4]  Binary decision diagrams and beyond: enabling technologies for formal verification , 1995, ICCAD.

[5]  Andrew Tinka,et al.  Conflict-Based Search with Optimal Task Assignment , 2018, AAMAS.

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

[7]  Hong Xu,et al.  Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios , 2017, ArXiv.

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

[9]  Peter J. Stuckey,et al.  New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding , 2020, ICAPS.

[10]  Pavel Surynek,et al.  An Optimization Variant of Multi-Robot Path Planning Is Intractable , 2010, AAAI.

[11]  Pavel Surynek.  Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases , 2013, SARA.

[12]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[13]  Peter J. Stuckey,et al.  Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search , 2019, ICAPS.

[14]  Pavel Surynek.  On the Tour Towards DPLL(MAPF) and Beyond , 2019, DDC@AI*IA.

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

[16]  Hadrien Cambazard,et al.  Exact algorithms for the order picking problem , 2017, Comput. Oper. Res..

[17]  Steven M. LaValle,et al.  Optimal Multi-Robot Path Planning on Graphs: Structure and Computational Complexity , 2015, ArXiv.

[18]  Sven Koenig,et al.  AI buzzwords explained: multi-agent path finding (MAPF) , 2017, SIGAI.

[19]  Mohammad Sohel Rahman,et al.  On Hamiltonian cycles and Hamiltonian paths , 2005, Inf. Process. Lett..

[20]  Roni Stern,et al.  An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives , 2016, SOCS.

[21]  Marijn J. H. Heule,et al.  SAT Competition 2016: Recent Developments , 2017, AAAI.

[22]  Cesare Tinelli,et al.  Satisfiability Modulo Theories , 2021, Handbook of Satisfiability.

[23]  Hadrien Cambazard,et al.  An efficient and general approach for the joint order batching and picker routing problem , 2020, Eur. J. Oper. Res..

[24]  Peter J. Stuckey,et al.  F-Cardinal Conflicts in Conflict-Based Search , 2020, SOCS.

[25]  Gilles Audemard,et al.  On the Glucose SAT Solver , 2018, Int. J. Artif. Intell. Tools.

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

[27]  Nathan R. Sturtevant,et al.  Benchmarks for Grid-Based Pathfinding , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[28]  Pavel Surynek,et al.  Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories , 2019, SOCS.

[29]  Sven Koenig,et al.  Task and Path Planning for Multi-Agent Pickup and Delivery , 2019, AAMAS.

[30]  Aaron Stump,et al.  SMT-COMP: Satisfiability Modulo Theories Competition , 2005, CAV.

[31]  Ian Parberry.  Solving the (n2 - 1)-Puzzle with 8/3 n3 Expected Moves , 2015, Algorithms.

[32]  Nathan R. Sturtevant,et al.  Conflict-based search for optimal multi-agent pathfinding , 2012, Artif. Intell..

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

[34]  Jaroslav Nesetril,et al.  Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history , 2001, Discret. Math..

[35]  Ian Parberry,et al.  Solving the (n 2 1)-Puzzle with 8 n 3 Expected Moves , 2015 .

[36]  Roni Stern,et al.  Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective , 2016, ECAI.

[37]  Manfred K. Warmuth,et al.  NxN Puzzle and Related Relocation Problem , 1990, J. Symb. Comput..

[38]  Ariel Felner,et al.  Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results , 2019, SOCS.

[39]  Cesare Tinelli,et al.  Lazy proofs for DPLL(T)-based SMT solvers , 2016, 2016 Formal Methods in Computer-Aided Design (FMCAD).

[40]  Pavel Surynek,et al.  SOLVING ABSTRACT COOPERATIVE PATH‐FINDING IN DENSELY POPULATED ENVIRONMENTS , 2014, Comput. Intell..

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

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

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

[44]  Michal Pechoucek,et al.  Multi-agent RRT: sampling-based cooperative pathfinding , 2013, AAMAS.

[45]  Peter J. Stuckey,et al.  Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation , 2019, ICAPS.

[46]  Steven M. LaValle,et al.  Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs , 2013, AAAI.

[47]  Han Zhang,et al.  Multi-Agent Path Finding with Mutex Propagation , 2020, ICAPS.

[48]  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.