Implicitly Coordinated Multi-Agent Path Finding Under Destination Uncertainty: Success Guarantees and Computational Complexity

Bernhard Nebel, Thomas Bolander, Thorsten Engesser, Robert Mattmüller

JAIR 2019 pp. 497-527

doi:10.1613/JAIR.1.11376 /jair/2019/nebel2019jair-implicitly/

Abstract

In multi-agent path finding, it is usually assumed that planning is performed centrally and that the destinations of the agents are common knowledge. We will drop both assumptions and analyze under which conditions it can be guaranteed that the agents reach their respective destinations using implicitly coordinated plans without communication.

PDF JAIR Semantic Scholar

Cite

Text

Nebel et al. "Implicitly Coordinated Multi-Agent Path Finding Under Destination Uncertainty: Success Guarantees and Computational Complexity." Journal of Artificial Intelligence Research, 2019. doi:10.1613/JAIR.1.11376

Markdown

[Nebel et al. "Implicitly Coordinated Multi-Agent Path Finding Under Destination Uncertainty: Success Guarantees and Computational Complexity." Journal of Artificial Intelligence Research, 2019.](https://mlanthology.org/jair/2019/nebel2019jair-implicitly/) doi:10.1613/JAIR.1.11376

BibTeX

@article{nebel2019jair-implicitly,
  title     = {{Implicitly Coordinated Multi-Agent Path Finding Under Destination Uncertainty: Success Guarantees and Computational Complexity}},
  author    = {Nebel, Bernhard and Bolander, Thomas and Engesser, Thorsten and Mattmüller, Robert},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2019},
  pages     = {497-527},
  doi       = {10.1613/JAIR.1.11376},
  volume    = {64},
  url       = {https://mlanthology.org/jair/2019/nebel2019jair-implicitly/}
}