ML Anthology

Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees

Ryan Luna, Kostas E. Bekris
IJCAI 2011 pp. 294-300
doi:10.5591/978-1-57735-516-8/IJCAI11-059 /ijcai/2011/luna2011ijcai-push/
IJCAI Semantic Scholar

Cite

Text

Luna and Bekris. "Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-059

Markdown

[Luna and Bekris. "Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/luna2011ijcai-push/) doi:10.5591/978-1-57735-516-8/IJCAI11-059

BibTeX

@inproceedings{luna2011ijcai-push,
  title     = {{Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees}},
  author    = {Luna, Ryan and Bekris, Kostas E.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {294-300},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-059},
  url       = {https://mlanthology.org/ijcai/2011/luna2011ijcai-push/}
}