.png){kind=icon}
Return
k-Robust Multi-Agent Path Finding
.png){kind=icon}
OA
AI
DOI：10.1609/socs.v8i1.18415.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available