Conflict-Free Multi-Agent Meeting

Authors

  • Dor Atzmon Ben-Gurion University
  • Shahar Idan Freiman Ben-Gurion University
  • Oscar Epshtein Ben-Gurion University
  • Oran Shichman Ben-Gurion University
  • Ariel Felner Ben-Gurion University

DOI:

https://doi.org/10.1609/icaps.v31i1.15942

Keywords:

Multi-agent And Distributed Planning, Applications And Case Studies Of Planning And Scheduling Techniques

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.
ICAPS-21 Proceedings Cover

Downloads

Published

2021-05-17

How to Cite

Atzmon, D., Freiman, S. I., Epshtein, O., Shichman, O., & Felner, A. (2021). Conflict-Free Multi-Agent Meeting. Proceedings of the International Conference on Automated Planning and Scheduling, 31(1), 16-24. https://doi.org/10.1609/icaps.v31i1.15942

Issue

Vol. 31 (2021): Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling

Section

Main Track