Conflict-Free Multi-Agent Meeting

Dor Atzmon; Shahar Idan Freiman; Oscar Epshtein; Oran Shichman; Ariel Felner

doi:10.1609/icaps.v31i1.15942

Conflict-Free Multi-Agent Meeting

Dor Atzmon
, Shahar Idan Freiman
, Oscar Epshtein
, Oran Shichman
, Ariel Felner

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

Multi-Agent Meeting (MAM) is the problem of finding a meeting location for multiple agents and paths to that location. Practically, a solution to MAM may contain conflicting paths. A related problem that plans conflict-free paths to a given set of goal locations is the Multi-Agent Path Finding problem (MAPF). In this paper, we solve the Conflict-Free Multi-Agent Meeting problem (CF-MAM). In CF-MAM, we find a meeting location for multiple agents (as in MAM) as well as conflict-free paths (as in MAPF) to that location. We introduce two novel algorithms, which combine MAM and MAPF solvers, for optimally solving CF-MAM. We prove the optimality of both algorithms and compare them experimentally, showing the pros and cons of each algorithm.

Original language	English
Title of host publication	31st International Conference on Automated Planning and Scheduling, ICAPS 2021
Editors	Susanne Biundo, Minh Do, Robert Goldman, Michael Katz, Qiang Yang, Hankz Hankui Zhuo
Publisher	Association for the Advancement of Artificial Intelligence
Pages	16-24
Number of pages	9
ISBN (Electronic)	9781713832317
DOIs	https://doi.org/10.1609/icaps.v31i1.15942
State	Published - 2021
Externally published	Yes
Event	31st International Conference on Automated Planning and Scheduling, ICAPS 2021 - Guangzhou, Virtual, China Duration: 2 Aug 2021 → 13 Aug 2021

Publication series

Name	Proceedings International Conference on Automated Planning and Scheduling, ICAPS
Volume	2021-August
ISSN (Print)	2334-0835
ISSN (Electronic)	2334-0843

Conference

Conference	31st International Conference on Automated Planning and Scheduling, ICAPS 2021
Country/Territory	China
City	Guangzhou, Virtual
Period	2/08/21 → 13/08/21

Bibliographical note

Publisher Copyright:
Copyright © 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Funding

This research was supported by ISF grant 844/17 and BSF grant 2017692 to Ariel Felner.

Funders	Funder number
United States-Israel Binational Science Foundation	2017692
Israel Science Foundation	844/17

Access to Document

10.1609/icaps.v31i1.15942

Cite this

Atzmon, D., Freiman, S. I., Epshtein, O., Shichman, O., & Felner, A. (2021). Conflict-Free Multi-Agent Meeting. In S. Biundo, M. Do, R. Goldman, M. Katz, Q. Yang, & H. H. Zhuo (Eds.), 31st International Conference on Automated Planning and Scheduling, ICAPS 2021 (pp. 16-24). (Proceedings International Conference on Automated Planning and Scheduling, ICAPS; Vol. 2021-August). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/icaps.v31i1.15942

Atzmon, Dor ; Freiman, Shahar Idan ; Epshtein, Oscar et al. / Conflict-Free Multi-Agent Meeting. 31st International Conference on Automated Planning and Scheduling, ICAPS 2021. editor / Susanne Biundo ; Minh Do ; Robert Goldman ; Michael Katz ; Qiang Yang ; Hankz Hankui Zhuo. Association for the Advancement of Artificial Intelligence, 2021. pp. 16-24 (Proceedings International Conference on Automated Planning and Scheduling, ICAPS).

@inproceedings{e27c710d85654fb79ec338f46711fdd7,

title = "Conflict-Free Multi-Agent Meeting",

abstract = "Multi-Agent Meeting (MAM) is the problem of finding a meeting location for multiple agents and paths to that location. Practically, a solution to MAM may contain conflicting paths. A related problem that plans conflict-free paths to a given set of goal locations is the Multi-Agent Path Finding problem (MAPF). In this paper, we solve the Conflict-Free Multi-Agent Meeting problem (CF-MAM). In CF-MAM, we find a meeting location for multiple agents (as in MAM) as well as conflict-free paths (as in MAPF) to that location. We introduce two novel algorithms, which combine MAM and MAPF solvers, for optimally solving CF-MAM. We prove the optimality of both algorithms and compare them experimentally, showing the pros and cons of each algorithm.",

author = "Dor Atzmon and Freiman, \{Shahar Idan\} and Oscar Epshtein and Oran Shichman and Ariel Felner",

note = "Publisher Copyright: Copyright {\textcopyright} 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 31st International Conference on Automated Planning and Scheduling, ICAPS 2021 ; Conference date: 02-08-2021 Through 13-08-2021",

year = "2021",

doi = "10.1609/icaps.v31i1.15942",

language = "אנגלית",

series = "Proceedings International Conference on Automated Planning and Scheduling, ICAPS",

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

pages = "16--24",

editor = "Susanne Biundo and Minh Do and Robert Goldman and Michael Katz and Qiang Yang and Zhuo, \{Hankz Hankui\}",

booktitle = "31st International Conference on Automated Planning and Scheduling, ICAPS 2021",

}

Atzmon, D, Freiman, SI, Epshtein, O, Shichman, O & Felner, A 2021, Conflict-Free Multi-Agent Meeting. in S Biundo, M Do, R Goldman, M Katz, Q Yang & HH Zhuo (eds), 31st International Conference on Automated Planning and Scheduling, ICAPS 2021. Proceedings International Conference on Automated Planning and Scheduling, ICAPS, vol. 2021-August, Association for the Advancement of Artificial Intelligence, pp. 16-24, 31st International Conference on Automated Planning and Scheduling, ICAPS 2021, Guangzhou, Virtual, China, 2/08/21. https://doi.org/10.1609/icaps.v31i1.15942

Conflict-Free Multi-Agent Meeting. / Atzmon, Dor; Freiman, Shahar Idan; Epshtein, Oscar et al.
31st International Conference on Automated Planning and Scheduling, ICAPS 2021. ed. / Susanne Biundo; Minh Do; Robert Goldman; Michael Katz; Qiang Yang; Hankz Hankui Zhuo. Association for the Advancement of Artificial Intelligence, 2021. p. 16-24 (Proceedings International Conference on Automated Planning and Scheduling, ICAPS; Vol. 2021-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Conflict-Free Multi-Agent Meeting

AU - Atzmon, Dor

AU - Freiman, Shahar Idan

AU - Epshtein, Oscar

AU - Shichman, Oran

AU - Felner, Ariel

PY - 2021

Y1 - 2021

N2 - Multi-Agent Meeting (MAM) is the problem of finding a meeting location for multiple agents and paths to that location. Practically, a solution to MAM may contain conflicting paths. A related problem that plans conflict-free paths to a given set of goal locations is the Multi-Agent Path Finding problem (MAPF). In this paper, we solve the Conflict-Free Multi-Agent Meeting problem (CF-MAM). In CF-MAM, we find a meeting location for multiple agents (as in MAM) as well as conflict-free paths (as in MAPF) to that location. We introduce two novel algorithms, which combine MAM and MAPF solvers, for optimally solving CF-MAM. We prove the optimality of both algorithms and compare them experimentally, showing the pros and cons of each algorithm.

AB - Multi-Agent Meeting (MAM) is the problem of finding a meeting location for multiple agents and paths to that location. Practically, a solution to MAM may contain conflicting paths. A related problem that plans conflict-free paths to a given set of goal locations is the Multi-Agent Path Finding problem (MAPF). In this paper, we solve the Conflict-Free Multi-Agent Meeting problem (CF-MAM). In CF-MAM, we find a meeting location for multiple agents (as in MAM) as well as conflict-free paths (as in MAPF) to that location. We introduce two novel algorithms, which combine MAM and MAPF solvers, for optimally solving CF-MAM. We prove the optimality of both algorithms and compare them experimentally, showing the pros and cons of each algorithm.

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

U2 - 10.1609/icaps.v31i1.15942

DO - 10.1609/icaps.v31i1.15942

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85123988622

T3 - Proceedings International Conference on Automated Planning and Scheduling, ICAPS

SP - 16

EP - 24

BT - 31st International Conference on Automated Planning and Scheduling, ICAPS 2021

A2 - Biundo, Susanne

A2 - Do, Minh

A2 - Goldman, Robert

A2 - Katz, Michael

A2 - Yang, Qiang

A2 - Zhuo, Hankz Hankui

PB - Association for the Advancement of Artificial Intelligence

T2 - 31st International Conference on Automated Planning and Scheduling, ICAPS 2021

Y2 - 2 August 2021 through 13 August 2021

ER -

Atzmon D, Freiman SI, Epshtein O, Shichman O, Felner A. Conflict-Free Multi-Agent Meeting. In Biundo S, Do M, Goldman R, Katz M, Yang Q, Zhuo HH, editors, 31st International Conference on Automated Planning and Scheduling, ICAPS 2021. Association for the Advancement of Artificial Intelligence. 2021. p. 16-24. (Proceedings International Conference on Automated Planning and Scheduling, ICAPS). doi: 10.1609/icaps.v31i1.15942

Conflict-Free Multi-Agent Meeting

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this