Introducing Delays in Multi-Agent Path Finding
Abstract: We consider a Multi-Agent Path Finding (MAPF) setting where agents have been assigned a plan, but during its execution some agents are delayed. Instead of replanning from scratch when such a delay occurs, we propose delay introduction, whereby we delay some additional agents so that the remainder of the plan can be executed safely. We show that finding the minimum number of additional delays is APX-Hard, i.e., it is NP-Hard to find a $(1+\varepsilon)$-approximation for some $\varepsilon>0$. However, in practice we can find optimal delay-introductions using Conflict-Based Search for very large numbers of agents, and both planning time and the resulting length of the plan are comparable, and sometimes outperform the state-of-the-art heuristics for replanning.
- Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity. In AAMAS, 932–940.
- Probabilistic Robust Multi-Agent Path Finding. In ICAPS, 29–37.
- Robust Multi-Agent Path Finding and Executing. JAIR, 67: 549–579.
- Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer.
- Intractability of Time-Optimal Multirobot Path Planning on 2D Grid Graphs with Holes. Robot. Autom. Lett., 2: 1941–1947.
- A scheduling-based approach to multi-agent path finding with weighted and capacitated arcs. In AAMAS, 748–756.
- From Multi-Agent Pathfinding to 3D Pipe Routing. In SOCS, 11–19.
- A Feedback Scheme to Reorder a Multi-Agent Execution Schedule by Persistently Optimizing a Switchable Action Dependency Graph. arXiv:2010.05254.
- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs. In WADS, volume 14079 of Lecture Notes in Computer Science, 326–339. Springer.
- Geft, T. 2023. Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids. In SOCS, 20–28. AAAI Press.
- Multi-Agent Path Finding with Kinematic Constraints. In ICAPS, 477–485.
- Multi-agent plan repairing. In Decision Making in Partially Observable, Uncertain Worlds: Exploring Insights from Multiple Communities, Proceedings of IJCAI 2011 Workshop, 1–6.
- Domain-independent multi-agent plan repair. J. Netw Comput Appl, 37: 76–88.
- An Introduction to Chromatic Sums. In ACM Conf. on CS, 39–45.
- MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search. In AAAI, 10256–10265.
- Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. In ICAPS, 477–485.
- EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding. In AAAI, 12353–12362.
- Searching with Consistent Prioritization for Multi-Agent Path Finding. In AAAI, 7643–7650.
- Multi-Agent Path Finding with Delay Probabilities. In AAAI, 3605–3612.
- Nebel, B. 2020. On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs. In ICAPS, 212–216.
- Plan reuse versus plan generation: A theoretical and empirical analysis. Art. Int., 76(1-2): 427–454.
- Okumura, K. 2023. LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding. In AAAI, 11655–11662.
- Automated Creation of Topological Maps in Unknown Environments Using a Swarm of Resource-Constrained Robots. Robot. Autom. Lett., 1(2): 746–753.
- Research Challenges and Opportunities in Multi-Agent Path Finding and Multi-Agent Pickup and Delivery Problems. In AAMAS, 1711–1715.
- Conflict-based search for optimal multi-agent pathfinding. Art. Int., 219: 40–66.
- Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. In SOCS, 151–159.
- Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]. In SOCS, 185–186.
- Anytime Informed Multi-Path Replanning Strategy for Complex Environments. IEEE Access, 11: 4105–4116.
- Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses. AI Magazine, 29(1): 9.
- Yu, J. 2016. Intractability of optimal multirobot path planning on planar graphs. Robot. Autom. Lett., 1: 33–40.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.