Multi-Agent Path Finding - An Overview

Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. In recent years, there has been a growing interest in MAPF in the Artificial Intelligence (AI) research community. This interest is partially because real-world MAPF applications, such as warehouse management, multi-robot teams, and aircraft management, are becoming more prevalent. In this overview, we discuss several possible definitions of the MAPF problem. Then, we survey MAPF algorithms, starting with fast but incomplete algorithms, then fast, complete but not optimal algorithms, and finally optimal algorithms. Then, we describe approximately optimal algorithms and conclude with non-classical MAPF and pointers for future reading and future work.

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

[2]  Hong Xu,et al.  Summary: Multi-Agent Path Finding with Kinematic Constraints , 2017, IJCAI.

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

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

[5]  Sven Koenig,et al.  Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding , 2018, ICAPS.

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

[7]  Laurence A. Wolsey,et al.  Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

[8]  Anton Andreychuk,et al.  Any-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm , 2017, ICAPS.

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

[10]  Roman Barták,et al.  Modeling and Solving the Multi-agent Pathfinding Problem in Picat , 2017, 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI).

[11]  Sven Koenig,et al.  Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments , 2017, AIIDE.

[12]  Stephanie Rosenthal,et al.  CoBots: Robust Symbiotic Autonomous Mobile Service Robots , 2015, IJCAI.

[13]  Anton Andreychuk,et al.  Multi-Agent Pathfinding with Continuous Time , 2019, IJCAI.

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

[15]  Sven Koenig,et al.  Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path Finding , 2015, SOCS.

[16]  Corina S. Pasareanu,et al.  Planning, Scheduling and Monitoring for Airport Surface Operations , 2016, AAAI Workshop: Planning for Hybrid Systems.

[17]  Roni Stern,et al.  Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks , 2019, SOCS.

[18]  Kostas E. Bekris,et al.  Multi-Agent Pathfinding with Simultaneous Execution of Single-Agent Primitives , 2021, SOCS.

[19]  Pavel Surynek.  Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT) , 2019, ArXiv.

[20]  Nathan R. Sturtevant,et al.  Extended Increasing Cost Tree Search for Non-Unit Cost Domains , 2018, IJCAI.

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

[22]  Roman Barták,et al.  Online Multi-Agent Pathfinding , 2019, AAAI.

[23]  Roni Stern,et al.  The increasing cost tree search for optimal multi-agent pathfinding , 2011, Artif. Intell..

[24]  Anton Andreychuk,et al.  Two Techniques That Enhance the Performance of Multi-robot Prioritized Path Planning , 2018, AAMAS.

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

[26]  Nathan R. Sturtevant,et al.  Optimal-Generation Variants of EPEA , 2013, SOCS.

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

[28]  Steven M. LaValle,et al.  Multi-agent Path Planning and Network Flow , 2012, WAFR.

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

[30]  Dor Atzmon,et al.  Multi-Train Path Finding , 2019, SOCS.

[31]  Maxim Likhachev,et al.  SIPP: Safe interval path planning for dynamic environments , 2011, 2011 IEEE International Conference on Robotics and Automation.

[32]  Peter Schüller,et al.  A General Formal Framework for Pathfinding Problems with Multiple Agents , 2013, AAAI.

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

[34]  Ariel Felner,et al.  Conflict-Oriented Windowed Hierarchical Cooperative A∗ , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[35]  Sven Koenig,et al.  Multi-Agent Path Finding for Large Agents , 2019, SOCS.

[36]  Roni Stern,et al.  Dynamic Potential Search - A New Bounded Suboptimal Search , 2016, SOCS.

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

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

[39]  Robert K. Brayton,et al.  Algorithms for discrete function manipulation , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[40]  Roman Barták,et al.  A Scheduling-Based Approach to Multi-Agent Path Finding with Weighted and Capacitated Arcs , 2018, AAMAS.

[41]  Howie Choset,et al.  Subdimensional expansion for multirobot path planning , 2015, Artif. Intell..

[42]  Michal Cáp,et al.  Complete Decentralized Method for On-Line Multi-Robot Trajectory Planning in Well-formed Infrastructures , 2015, ICAPS.

[43]  David Tolpin,et al.  ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding , 2015, SOCS.

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

[45]  Judea Pearl,et al.  Studies in Semi-Admissible Heuristics , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[48]  Ira Pohl,et al.  Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..

[49]  Pavel Surynek,et al.  Multi-Robot Path Planning , 2011 .

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

[51]  Roman Barták,et al.  Robust Multi-Agent Path Finding , 2018, SOCS.

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

[53]  Roni Stern,et al.  Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem , 2014, SOCS.

[54]  Wheeler Ruml,et al.  Bounded Suboptimal Search: A Direct Approach Using Inadmissible Estimates , 2011, IJCAI.