Fetching the paper…
Reading the bibliography…
Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents to their goal locations without collisions.
Studies in Semi-Admissible Heuristics
Pearl, J.; and Kim, J. H. 1982 · 1982
Earlier work this paper cites.
Cooperative Pathfinding
Silver, D. 2005 · 2005
Earlier work this paper cites.
Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses
Wurman, P. R.; D’Andrea, R.; and Mountz, M. 2007 · 2007
Earlier work this paper cites.
Finding Optimal Solutions to Cooperative Pathfinding Problems
Standley, T. S. 2010 · 2010
Earlier work this paper cites.
Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees
Luna, R.; and Bekris, K. E. 2011 · 2011
Earlier work this paper cites.
SIPP: Safe interval path planning for dynamic environments
Phillips, M.; and Likhachev, M. 2011 · 2011
Earlier work this paper cites.
Push and Rotate: Cooperative Multi-Agent Path Planning
de Wilde, B.; ter Mors, A.; and Witteveen, C. 2013 · 2013
Earlier work this paper cites.
The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding
Sharon, G.; Stern, R.; Goldenberg, M.; and Felner, A. 2013 · 2013
Earlier work this paper cites.
Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs
Yu, J.; and LaValle, S. M. 2013 · 2013
Earlier work this paper cites.
Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem
Barer, M.; Sharon, G.; Stern, R.; and Felner, A. 2014 · 2014
Earlier work this paper cites.
Enhanced Partial Expansion A*
Goldenberg, M.; Felner, A.; Stern, R.; Sharon, G.; Sturtevant, N. R.; Holte, R. C.; and Schaeffer, J. 2014 · 2014
Earlier work this paper cites.
Complete Decentralized Method for On-Line Multi-Robot Trajectory Planning in Well-Formed Infrastructures
Cáp, M.; Vokrínek, J.; and Kleiner, A. 2015 · 2015
Cited alongside, same era.
Conflict-Based Search for Optimal Multi-Agent Pathfinding
Sharon, G.; Stern, R.; Felner, A.; and Sturtevant, N. R. 2015 · 2015
Cited alongside, same era.
Subdimensional Expansion: A Framework for Computationally Tractable Multirobot Path Planning
Wagner, G. 2015 · 2015
Cited alongside, same era.
Multi-Agent Path Finding with Kinematic Constraints
Hönig, W.; Kumar, T. K. S.; Cohen, L.; Ma, H.; Xu, H.; Ayanian, N.; and Koenig, S. 2016 · 2016
Cited alongside, same era.
Planning, Scheduling and Monitoring for Airport Surface Operations
Morris, R.; Pasareanu, C. S.; Luckow, K. S.; Malik, W.; Ma, H.; Kumar, T. K. S.; and Koenig, S. 2016 · 2016
Cited alongside, same era.
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks
A Multi-Label A* Algorithm for Multi-Agent Pathfinding
Grenouilleau, F.; van Hoeve, W.; and Hooker, J. N. 2019 · 2019
Later among the works it cites.
Persistent and Robust Execution of MAPF Schedules in Warehouses
Hönig, W.; Kiesel, S.; Tinka, A.; Durham, J. W.; and Ayanian, N. 2019 · 2019
Later among the works it cites.
Branch-and-Cut-and-Price for Multi-Agent Pathfinding
Lam, E.; Le Bodic, P.; Harabor, D.; and Stuckey, P. J. 2019 · 2019
Later among the works it cites.
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search
Li, J.; Felner, A.; Boyarski, E.; Ma, H.; and Koenig, S. 2019 · 2019
Later among the works it cites.
Task and Path Planning for Multi-Agent Pickup and Delivery
Liu, M.; Ma, H.; Li, J.; and Koenig, S. 2019 · 2019
Later among the works it cites.
Searching with Consistent Prioritization for Multi-Agent Path Finding
Ma, H.; Harabor, D.; Stuckey, P. J.; Li, J.; and Koenig, S. 2019 · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ma, H.; Li, J.; Kumar, T. K. S.; and Koenig, S. 2017 · 2017
Cited alongside, same era.
Generalized Target Assignment and Path Finding Using Answer Set Programming
Nguyen, V.; Obermeier, P.; Son, T. C.; Schaub, T.; and Yeoh, W. 2017 · 2017
Cited alongside, same era.
Trajectory Planning for Quadrotor Swarms
Hönig, W.; Preiss, J. A.; Kumar, T. K. S.; Sukhatme, G. S.; and Ayanian, N. 2018 · 2018
Cited alongside, same era.
Lifelong Multi-Agent Path Finding in a Dynamic Environment
Wan, Q.; Gu, C.; Sun, S.; Chen, M.; Huang, H.; and Jia, X. 2018 · 2018
Cited alongside, same era.
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning
Cohen, L.; Uras, T.; Kumar, T. K. S.; and Koenig, S. 2019 · 2019
Cited alongside, same era.
Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation
Gange, G.; Harabor, D.; and Stuckey, P. J. 2019 · 2019
Cited alongside, same era.
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding
Li, J.; Gange, G.; Harabor, D.; Stuckey, P. J.; Ma, H.; and Koenig, S. 2020a
Cited in the paper.
Later among the works it cites.
Priority Inheritance with Backtracking for Iterative Multi-Agent Path Finding
Okumura, K.; Machida, M.; Défago, X.; and Tamura, Y. 2019 · 2019
Later among the works it cites.
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Stern, R.; Sturtevant, N. R.; Felner, A.; Koenig, S.; Ma, H.; Walker, T. T.; Li, J.; Atzmon, D.; Cohen, L.; Kumar, T. K. S.; Barták, R.; and Boyarski, E. 2019 · 2019
Later among the works it cites.
Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories
Surynek, P. 2019 · 2019
Later among the works it cites.
Online Multi-Agent Pathfinding
Svancara, J.; Vlk, M.; Stern, R.; Atzmon, D.; and Barták, R. 2019 · 2019
Later among the works it cites.
Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers
Kou, N. M.; Peng, C.; Ma, H.; Kumar, T. K. S.; and Koenig, S. 2020 · 2020
Closest in time.