k-Robust Multi-Agent Path Finding

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.

Authors

• Dor Atzmon
• Ariel Felner
• Roni Stern
• Glenn Wagner
• Roman Barták
• Neng-Fa Zhou

Keywords

No keywords are indexed for this paper.