Multi-agent path finding with deadlines: Preliminary results

  • Hang Ma
  • , Glenn Wagner
  • , Ariel Feiner
  • , Jiaoyang Li
  • , T. K. Satish Kumar
  • , Sven Koenig

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    5 Scopus citations

    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 languageEnglish
    Title of host publication17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018
    PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
    Pages2004-2006
    Number of pages3
    ISBN (Print)9781510868083
    StatePublished - 1 Jan 2018
    Event17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018 - Stockholm, Sweden
    Duration: 10 Jul 201815 Jul 2018

    Publication series

    NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
    Volume3
    ISSN (Print)1548-8403
    ISSN (Electronic)1558-2914

    Conference

    Conference17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018
    Country/TerritorySweden
    CityStockholm
    Period10/07/1815/07/18

    ASJC Scopus subject areas

    • Artificial Intelligence
    • Software
    • Control and Systems Engineering

    Fingerprint

    Dive into the research topics of 'Multi-agent path finding with deadlines: Preliminary results'. Together they form a unique fingerprint.

    Cite this