AAAI Publications, Tenth Annual Symposium on Combinatorial Search

Font Size: 
k-Robust Multi-Agent Path Finding
Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng-Fa Zhou

Last modified: 2017-06-05


In the multi-agent path-finding (MAPF) problem a plan is needed to move a set of agents from their initial location to their goals without collisions. In this paper we introduce and study the k-robust MAPF problem, where we seek a plan that is robust to k unexpected delays per agent.

Full Text: PDF