ML Anthology

Bounded Suboptimal Multi-Agent Path Finding Using Highways

Liron Cohen, Sven Koenig
IJCAI 2016 pp. 3978-3979
/ijcai/2016/cohen2016ijcai-bounded/

Abstract

The multi-agent path finding (MAPF) problem is defined as follows: Given a graph and a set of agents with unique start and goal vertices, find collision-free paths for all agents from their respective start vertices to their respective goal vertices. Our objective is to minimize the the total arrival time. MAPF has many applications such as video games, traffic control and robotics. PDF

PDF IJCAI Semantic Scholar

Cite

Text

Cohen and Koenig. "Bounded Suboptimal Multi-Agent Path Finding Using Highways." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[Cohen and Koenig. "Bounded Suboptimal Multi-Agent Path Finding Using Highways." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/cohen2016ijcai-bounded/)

BibTeX

@inproceedings{cohen2016ijcai-bounded,
  title     = {{Bounded Suboptimal Multi-Agent Path Finding Using Highways}},
  author    = {Cohen, Liron and Koenig, Sven},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {3978-3979},
  url       = {https://mlanthology.org/ijcai/2016/cohen2016ijcai-bounded/}
}