@inproceedings{6127aac8678a4fa4840da34a99629174,
title = "Multi-agent path finding with deadlines: Preliminary results",
abstract = "We formalize the problem of 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 a given deadline, without colliding with each other. We first show that the MAPF-DL problem is NP-hard to solve optimally. We then present an optimal MAPF-DL algorithm based on a reduction of the MAPF-DL problem to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network.",
author = "Hang Ma and Glenn Wagner and Ariel Feiner and Jiaoyang Li and \{Satish Kumar\}, \{T. K.\} and Sven Koenig",
note = "Publisher Copyright: {\textcopyright} 2018 International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.; 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018 ; Conference date: 10-07-2018 Through 15-07-2018",
year = "2018",
month = jan,
day = "1",
language = "الإنجليزيّة",
isbn = "9781510868083",
series = "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS",
pages = "2004--2006",
booktitle = "17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018",
}