IJCAI 2020poster0 citations
Multi-Directional Heuristic Search
Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf Shperberg, Nathan Sturtevant, Sven Koenig
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*.
Planning and Scheduling: Planning and SchedulingAgent-based and Multi-agent Systems: Multi-agent PlanningHeuristic Search and Game Playing: Heuristic Search
BibTeX
@inproceedings{ijcai2020p562,
title = {Multi-Directional Heuristic Search},
author = {Atzmon, Dor and Li, Jiaoyang and Felner, Ariel and Nachmani, Eliran and Shperberg, Shahaf and Sturtevant, Nathan and Koenig, Sven},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-20}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Christian Bessiere},
pages = {4062--4068},
year = {2020},
month = {7},
note = {Main track},
doi = {10.24963/ijcai.2020/562},
url = {https://doi.org/10.24963/ijcai.2020/562},
}