k-Robust Multi-Agent Path Finding

doi:10.1609/socs.v8i1.18415

k-Robust Multi-Agent Path Finding

2021-09-01

0

OA

AI

DOI：10.1609/socs.v8i1.18415

原文链接

原文求助

摘要

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.

k-Robust Multi-Agent Path Finding

摘要

期刊

机构

引用论文