Learn all about Multi-Agent Path Finding (MAPF)
D. Atzmon, R. Stern, A. Felner, G. Wagner, R. Bartak and N. Zhou. Robust Multi-Agent Path Finding. In Proceedings of the Symposium on Combinatorial Search (SoCS), pages 2-9, 2018.
Abstract: 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.