Finiding All Optimal Solutions in Multi-Agent Path Finding

Shahar Bardugo, Dor Atzmon

Research output: Contribution to journalConference articlepeer-review


The Multi-Agent Path Finding problem (MAPF) aims to find conflict-free paths for a group of agents leading each agent to its respective goal. In this paper, we study the requirement of finding all optimal solutions in MAPF. We discuss the representation of all optimal solutions, propose three algorithms for finding them, and compare the algorithms experimentally.

Original languageEnglish
Pages (from-to)259-260
Number of pages2
JournalThe International Symposium on Combinatorial Search
Issue number1
StatePublished - 2024
Event17th International Symposium on Combinatorial Search, SoCS 2024 - Kananaskis, Canada
Duration: 6 Jun 20248 Jun 2024

Bibliographical note

Publisher Copyright:
© 2024, Association for the Advancement of Artificial Intelligence ( All rights reserved.


Dive into the research topics of 'Finiding All Optimal Solutions in Multi-Agent Path Finding'. Together they form a unique fingerprint.

Cite this