Online Multi-Agent Pathfinding

Jirí Svancara, Marek Vlk, Roni Stern, Dor Atzmon, Roman Barták

AAAI 2019 pp. 7732-7739

doi:10.1609/AAAI.V33I01.33017732 /aaai/2019/svancara2019aaai-online/

Abstract

Multi-agent pathfinding (MAPF) is the problem of moving a group of agents to a set of target destinations while avoiding collisions. In this work, we study the online version of MAPF where new agents appear over time. Several variants of online MAPF are defined and analyzed theoretically, showing that it is not possible to create an optimal online MAPF solver. Nevertheless, we propose effective online MAPF algorithms that balance solution quality, runtime, and the number of plan changes an agent makes during execution.

PDF AAAI Semantic Scholar

Cite

Text

Svancara et al. "Online Multi-Agent Pathfinding." AAAI Conference on Artificial Intelligence, 2019. doi:10.1609/AAAI.V33I01.33017732

Markdown

[Svancara et al. "Online Multi-Agent Pathfinding." AAAI Conference on Artificial Intelligence, 2019.](https://mlanthology.org/aaai/2019/svancara2019aaai-online/) doi:10.1609/AAAI.V33I01.33017732

BibTeX

@inproceedings{svancara2019aaai-online,
  title     = {{Online Multi-Agent Pathfinding}},
  author    = {Svancara, Jirí and Vlk, Marek and Stern, Roni and Atzmon, Dor and Barták, Roman},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {7732-7739},
  doi       = {10.1609/AAAI.V33I01.33017732},
  url       = {https://mlanthology.org/aaai/2019/svancara2019aaai-online/}
}