ML Anthology

Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs

Adi Botea, Davide Bonusi, Pavel Surynek
JAIR 2018 pp. 273-314
doi:10.1613/JAIR.1.11212 /jair/2018/botea2018jair-solving/
JAIR Semantic Scholar

Cite

Text

Botea et al. "Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs." Journal of Artificial Intelligence Research, 2018. doi:10.1613/JAIR.1.11212

Markdown

[Botea et al. "Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs." Journal of Artificial Intelligence Research, 2018.](https://mlanthology.org/jair/2018/botea2018jair-solving/) doi:10.1613/JAIR.1.11212

BibTeX

@article{botea2018jair-solving,
  title     = {{Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs}},
  author    = {Botea, Adi and Bonusi, Davide and Surynek, Pavel},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2018},
  pages     = {273-314},
  doi       = {10.1613/JAIR.1.11212},
  volume    = {62},
  url       = {https://mlanthology.org/jair/2018/botea2018jair-solving/}
}