Finiding All Optimal Solutions in Multi-Agent Path Finding

Shahar Bardugo; Dor Atzmon

doi:10.1609/socs.v17i1.31570

Finiding All Optimal Solutions in Multi-Agent Path Finding

Shahar Bardugo
, Dor Atzmon

Research output: Contribution to journal › Conference article › peer-review

Abstract

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 language	English
Pages (from-to)	259-260
Number of pages	2
Journal	The International Symposium on Combinatorial Search
Volume	17
Issue number	1
DOIs	https://doi.org/10.1609/socs.v17i1.31570
State	Published - 1 Jan 2024
Event	17th International Symposium on Combinatorial Search, SoCS 2024 - Kananaskis, Canada Duration: 6 Jun 2024 → 8 Jun 2024

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1609/socs.v17i1.31570

Cite this

@article{3f00fc4d5eec44b28dedf06b8daa238b,

title = "Finiding All Optimal Solutions in Multi-Agent Path Finding",

abstract = "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.",

author = "Shahar Bardugo and Dor Atzmon",

note = "Publisher Copyright: {\textcopyright} 2024, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 17th International Symposium on Combinatorial Search, SoCS 2024 ; Conference date: 06-06-2024 Through 08-06-2024",

year = "2024",

month = jan,

day = "1",

doi = "10.1609/socs.v17i1.31570",

language = "English",

volume = "17",

pages = "259--260",

journal = "The International Symposium on Combinatorial Search",

issn = "2832-9171",

publisher = "Association for the Advancement of Artificial Intelligence",

number = "1",

}

TY - JOUR

T1 - Finiding All Optimal Solutions in Multi-Agent Path Finding

AU - Bardugo, Shahar

AU - Atzmon, Dor

PY - 2024/1/1

Y1 - 2024/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85196620010

U2 - 10.1609/socs.v17i1.31570

DO - 10.1609/socs.v17i1.31570

M3 - Conference article

AN - SCOPUS:85196620010

SN - 2832-9171

VL - 17

SP - 259

EP - 260

JO - The International Symposium on Combinatorial Search

JF - The International Symposium on Combinatorial Search

IS - 1

T2 - 17th International Symposium on Combinatorial Search, SoCS 2024

Y2 - 6 June 2024 through 8 June 2024

ER -

Finiding All Optimal Solutions in Multi-Agent Path Finding

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this