Multi-Directional Heuristic Search
Conference Paper, Proceedings of 29th International Joint Conference on Artificial Intelligence (IJCAI '20), pp. 4062 - 4068, January, 2021
Abstract
In the Multi-Agent Meeting problem (MAM), the task is to find a meeting location for multiple agents, as well as a path for each agent to that location. In this paper, we introduce MM*, a Multi-Directional Heuristic Search algorithm that finds the optimal meeting location under different cost functions. MM* generalizes the Meet in the Middle (MM) bidirectional search algorithm to the case of finding an optimal meeting location for multiple agents. Several admissible heuristics are proposed, and experiments demonstrate the benefits of MM*.
BibTeX
@conference{Atzmon-2021-131409,author = {Dor Atzmon and Jiaoyang Li and Ariel Felner and Eliran Nachmani and Shahaf Shperberg and Nathan Sturtevant and Sven Koenig},
title = {Multi-Directional Heuristic Search},
booktitle = {Proceedings of 29th International Joint Conference on Artificial Intelligence (IJCAI '20)},
year = {2021},
month = {January},
pages = {4062 - 4068},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.