Abstract
Multi-Agent Meeting (MAM) is the problem of finding a meeting location for multiple agents and paths to that location. Recently, a Multi-Directional Heuristic Search algorithm, called MM*, was introduced. MM* is a state-of-the-art MAM optimal solver that searches from multiple directions (one for each agent) and is guided by a heuristic function. 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 compare both algorithms experimentally, showing the pros and cons of each algorithm.
| Original language | English |
|---|---|
| Title of host publication | 14th International Symposium on Combinatorial Search, SoCS 2021 |
| Editors | Hang Ma, Ivan Serina |
| Publisher | Association for the Advancement of Artificial Intelligence |
| Pages | 147-149 |
| Number of pages | 3 |
| ISBN (Electronic) | 9781713834557 |
| State | Published - 2021 |
| Externally published | Yes |
| Event | 14th International Symposium on Combinatorial Search, SoCS 2021 - Guangzhou, Virtual, China Duration: 26 Jul 2021 → 30 Jul 2021 |
Publication series
| Name | 14th International Symposium on Combinatorial Search, SoCS 2021 |
|---|
Conference
| Conference | 14th International Symposium on Combinatorial Search, SoCS 2021 |
|---|---|
| Country/Territory | China |
| City | Guangzhou, Virtual |
| Period | 26/07/21 → 30/07/21 |
Bibliographical note
Publisher Copyright:Copyright © 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.