Anytime Multi-Agent Path Finding via Large Neighborhood Search

Multi-Agent Path Finding (MAPF) is the challenging problem of computing collision-free paths for multiple agents. Algorithms for solving MAPF can be categorized on a spectrum. At one end are (bounded-sub)optimal algorithms that can find high-quality solutions for small problems. At the other end are unbounded-suboptimal algorithms that can solve large problems but usually find low-quality solutions. In this paper, we consider a third approach that combines the best of both worlds: anytime algorithms that quickly find an initial solution using efficient MAPF algorithms from the literature, even for large problems, and that subsequently improve the solution quality to near-optimal as time progresses by replanning subgroups of agents using Large Neighborhood Search. We compare our algorithm MAPFLNS against a range of existing work and report significant gains in scalability, runtime to the initial solution, and speed of improving the solution.

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

[2]  Gilbert Laporte,et al.  An adaptive large neighborhood search heuristic for the Pollution-Routing Problem , 2012, Eur. J. Oper. Res..

[3]  Enrico Pontelli,et al.  A Large Neighboring Search Schema for Multi-agent Optimization , 2018, CP.

[4]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[5]  Yisong Yue,et al.  A General Large Neighborhood Search Framework for Solving Integer Programs , 2020, ArXiv.

[6]  Wheeler Ruml,et al.  EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding , 2020, AAAI.

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

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

[9]  Sven Koenig,et al.  Anytime Multi-Agent Path Finding via Large Neighborhood Search , 2021, IJCAI.

[10]  Tomas Lozano-Perez,et al.  On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

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

[12]  Michael Wooldridge,et al.  Autonomous agents and multi-agent systems , 2014 .

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

[14]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[15]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

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

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

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

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[21]  Pierre Le Bodic,et al.  New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding , 2020, ICAPS.

[22]  S. Mohanty,et al.  Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World , 2021, NeurIPS.

[23]  Ariel Felner,et al.  Improved Heuristics for Multi-Agent Pathfinding with Conflict-Based Search∗ , 2019 .

[24]  Joydeep Biswas,et al.  X*: Anytime Multi-Agent Path Finding for Sparse Domains using Window-Based Iterative Repairs , 2018, Artif. Intell..

[25]  Wenjie Wang,et al.  An iterative approach for makespan-minimized multi-agent path planning in discrete space , 2014, Autonomous Agents and Multi-Agent Systems.

[26]  Oladele A. Ogunseitan,et al.  in Transportation Science , 2009 .

[27]  Sven Koenig,et al.  Anytime Focal Search with Applications , 2018, IJCAI.

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

[29]  Peter J. Stuckey,et al.  Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge , 2021, ICAPS.