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

Cite

Text

Nebel et al. "Implicitly Coordinated Multi-Agent Path Finding Under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/890

Markdown

[Nebel et al. "Implicitly Coordinated Multi-Agent Path Finding Under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/nebel2019ijcai-implicitly/) doi:10.24963/IJCAI.2019/890

BibTeX

@inproceedings{nebel2019ijcai-implicitly,
  title     = {{Implicitly Coordinated Multi-Agent Path Finding Under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract)}},
  author    = {Nebel, Bernhard and Bolander, Thomas and Engesser, Thorsten and Mattmüller, Robert},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {6372-6376},
  doi       = {10.24963/IJCAI.2019/890},
  url       = {https://mlanthology.org/ijcai/2019/nebel2019ijcai-implicitly/}
}