Abstract
This is an extended abstract of a paper to be published at ICAPS 2021 (Ma 2021). We study online Multi-Agent Path Finding (MAPF), where new agents are constantly revealed over time and all agents must find collision-free paths to their given goal locations. We generalize existing complexity results of (offline) MAPF to online MAPF. We classify online MAPF algorithms into different categories. We present several complexity and competitiveness results for online MAPF and its algorithms, which provides theoretical insights into the effectiveness of using MAPF algorithms in an online setting for the first time.
Cite
CITATION STYLE
Ma, H. (2021). Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding. In 14th International Symposium on Combinatorial Search, SoCS 2021 (pp. 182–184). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/socs.v12i1.18577
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
