Solving Multi-agent Path Finding on Strongly Biconnected Digraphs

Adi Botea, Davide Bonusi, Pavel Surynek. Solving Multi-agent Path Finding on Strongly Biconnected Digraphs. J. Artif. Intell. Res. (JAIR), 62:273-314, 2018. [doi]

@article{BoteaBS18-0,
  title = {Solving Multi-agent Path Finding on Strongly Biconnected Digraphs},
  author = {Adi Botea and Davide Bonusi and Pavel Surynek},
  year = {2018},
  doi = {10.1613/jair.1.11212},
  url = {https://doi.org/10.1613/jair.1.11212},
  researchr = {https://researchr.org/publication/BoteaBS18-0},
  cites = {0},
  citedby = {0},
  journal = {J. Artif. Intell. Res. (JAIR)},
  volume = {62},
  pages = {273-314},
}