Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios

Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hoenig, T.K. Satish Kumar, Tansel Uras, Hong Xu, Craig Tovey, and Guni Sharon. Overview: generalizations of multi-agent path finding to real-world scenarios. In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI) Workshop on Multi-Agent Path Finding. 2016. URL: https://www.andrew.cmu.edu/user/gswagner/workshop/IJCAI_2016_WOMPF_paper_6.pdf.
[full text] [BibTeX▼]

@inproceedings{ma2016,
    author = "Ma, Hang and Koenig, Sven and Ayanian, Nora and Cohen, Liron and Hoenig, Wolfgang and Kumar, T.K. Satish and Uras, Tansel and Xu, Hong and Tovey, Craig and Sharon, Guni",
    title = "Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios",
    year = "2016",
    url = "https://www.andrew.cmu.edu/user/gswagner/workshop/IJCAI\_2016\_WOMPF\_paper\_6.pdf",
    booktitle = "Proceedings of the 25th International Joint Conference on Artificial Intelligence ({IJCAI}) Workshop on Multi-Agent Path Finding"
}

Abstract

Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical computer science and operations research. We discuss issues that arise when generalizing MAPF methods to real-world scenarios and four research directions that address them. We emphasize the importance of addressing these issues as opposed to developing faster methods for the standard formulation of the MAPF problem.

Full Text

[download]