Robust Multi-Agent Path Finding
Dor Atzmon, Roni Stern, Ariel Felner et al. · Proceedings of the International Symposium on Combinatorial Search · 2021
In the multi-agent path-finding (MAPF) problem, the task is to find a plan for moving a set of agents from their initial locations to their goals without collisions. Following this plan, however, may not be possible due to unexpected events that delay some of the agents. We explore the notion of k-robust MAPF, where the task is to find a plan that can be followed even if a limited number of such delays occur. k-robust MAPF is especially suitable for agents with a control mechanism that guarantees that each agent is within a limited number of steps away from its pre-defined plan. We propose sufficient and required conditions for finding a k-robust plan, and show how to convert several MAPF solvers to find such plans. Then, we show the benefit of using a k-robust plan during execution, and for finding plans that are likely to succeed.
Cited by 22 works. doi:10.1609/socs.v9i1.18445 Open-access PDF
Authors
References
- A Formal Basis for the Heuristic Determination of Minimum Cost Paths
- Conflict-based search for optimal multi-agent pathfinding
- Cooperative Pathfinding
- Benchmarks for Grid-Based Pathfinding
- Finding Optimal Solutions to Cooperative Pathfinding Problems
- The increasing cost tree search for optimal multi-agent pathfinding
- Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs
- Subdimensional expansion for multirobot path planning
- Complete Algorithms for Cooperative Pathfinding Problems
- Planning optimal paths for multiple robots on graphs