Multi-Agent Path Finding with Deadlines
Abstract
We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their given start vertices within the deadline, without colliding with each other. We first show that MAPF-DL is NP-hard to solve optimally. We then present two classes of optimal algorithms, one based on a reduction of MAPF-DL to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network and the other one based on novel combinatorial search algorithms. Our empirical results demonstrate that these MAPF-DL solvers scale well and each one dominates the other ones in different scenarios.
Cite
Text
Ma et al. "Multi-Agent Path Finding with Deadlines." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/58Markdown
[Ma et al. "Multi-Agent Path Finding with Deadlines." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/ma2018ijcai-multi/) doi:10.24963/IJCAI.2018/58BibTeX
@inproceedings{ma2018ijcai-multi,
title = {{Multi-Agent Path Finding with Deadlines}},
author = {Ma, Hang and Wagner, Glenn and Felner, Ariel and Li, Jiaoyang and Kumar, T. K. Satish and Koenig, Sven},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2018},
pages = {417-423},
doi = {10.24963/IJCAI.2018/58},
url = {https://mlanthology.org/ijcai/2018/ma2018ijcai-multi/}
}