Which Objective Function is Solved Faster in Multi-Agent Pathfinding? It Depends

Jiří Švancara, Dor Atzmon, Klaus Strauch, Roland Kaminski, Torsten Schaub

Research output: Contribution to journalConference articlepeer-review

Abstract

Multi-agent pathfinding (MAPF) is the problem of finding safe paths for multiple mobile agents within a shared environment. This problem finds practical applications in real-world scenarios like navigation, warehousing, video games, and autonomous intersections. Finding the optimal solution to MAPF is known to be computationally hard. In the literature, two commonly used cost functions are makespan and the sum of costs. To tackle this complex problem, various algorithms have been developed, falling into two main categories: search-based approaches (e.g., Conflict Based Search) and reduction-based approaches, including reduction to SAT or ASP. In this study, we empirically compare these two approaches in the context of both makespan and the sum of costs, aiming to identify situations where one cost function presents more challenges than the other. We compare our results with older studies and improve upon their findings. Despite these solving approaches initially being designed for different cost functions, we observe similarities in their behavior. Furthermore, we identify a tipping point related to the size of the environment. On smaller maps, the sum of costs is more challenging, while makespan poses greater difficulties on larger maps for both solving paradigms, defying intuitive expectations. Our study also offers insights into the reasons behind this behavior.

Original languageEnglish
Pages (from-to)23-33
Number of pages11
JournalInternational Conference on Agents and Artificial Intelligence
Volume3
DOIs
StatePublished - 2024
Event16th International Conference on Agents and Artificial Intelligence, ICAART 2024 - Rome, Italy
Duration: 24 Feb 202426 Feb 2024

Bibliographical note

Publisher Copyright:
© 2024 by SCITEPRESS - Science and Technology Publications, Lda.

Keywords

  • Makespan
  • Multi-Agent Pathfinding
  • Reduction-Based Algorithm
  • Search-Based Algorithm
  • Sum of Costs

Fingerprint

Dive into the research topics of 'Which Objective Function is Solved Faster in Multi-Agent Pathfinding? It Depends'. Together they form a unique fingerprint.

Cite this