ML Anthology

Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract)

Adi Botea, Davide Bonusi, Pavel Surynek
IJCAI 2018 pp. 5563-5567
doi:10.24963/IJCAI.2018/785 /ijcai/2018/botea2018ijcai-solving/

Abstract

We present and evaluate diBOX, an algorithm for multi-agent path finding on strongly biconnected directed graphs. diBOX runs in polynomial time, computes suboptimal solutions and is complete for instances on strongly biconnected digraphs with at least two unoccupied positions. A detailed empirical analysis shows a good scalability for diBOX.

PDF IJCAI Semantic Scholar

Cite

Text

Botea et al. "Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/785

Markdown

[Botea et al. "Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/botea2018ijcai-solving/) doi:10.24963/IJCAI.2018/785

BibTeX

@inproceedings{botea2018ijcai-solving,
  title     = {{Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract)}},
  author    = {Botea, Adi and Bonusi, Davide and Surynek, Pavel},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2018},
  pages     = {5563-5567},
  doi       = {10.24963/IJCAI.2018/785},
  url       = {https://mlanthology.org/ijcai/2018/botea2018ijcai-solving/}
}