Work

k-Robust Multi-Agent Path Finding

Year: 2021
Type: conference-paper
Abstract: 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.
Language: English
Open Access status: diamond
OpenAlex ID: W4312745847
FWCI: 1.651
Cites: 3
Cited by: 12
Related to: 10