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.
| Original language | English |
|---|---|
| Title of host publication | 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018 |
| Publisher | International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) |
| Pages | 2004-2006 |
| Number of pages | 3 |
| ISBN (Print) | 9781510868083 |
| State | Published - 2018 |
| Externally published | Yes |
| Event | 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018 - Stockholm, Sweden Duration: 10 Jul 2018 → 15 Jul 2018 |
Publication series
| Name | Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS |
|---|---|
| Volume | 3 |
| ISSN (Print) | 1548-8403 |
| ISSN (Electronic) | 1558-2914 |
Conference
| Conference | 17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018 |
|---|---|
| Country/Territory | Sweden |
| City | Stockholm |
| Period | 10/07/18 → 15/07/18 |
Bibliographical note
Publisher Copyright:© 2018 International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
Funding
The research at USC was supported by the National Science Foundation (NSF) under grant numbers 1724392,1409987, and 1319966 as well as a gift from Amazon.
| Funders | Funder number |
|---|---|
| National Science Foundation | 1409987, 1724392, 1319966 |