Skip to main navigation Skip to search Skip to main content

Multi-directional heuristic search

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    9 Scopus citations

    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*.

    Original languageEnglish
    Title of host publicationProceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020
    EditorsChristian Bessiere
    PublisherInternational Joint Conferences on Artificial Intelligence
    Pages4062-4068
    Number of pages7
    ISBN (Electronic)9780999241165
    StatePublished - 1 Jan 2020
    Event29th International Joint Conference on Artificial Intelligence, IJCAI 2020 - Yokohama, Japan
    Duration: 1 Jan 2021 → …

    Publication series

    NameIJCAI International Joint Conference on Artificial Intelligence
    Volume2021-January
    ISSN (Print)1045-0823

    Conference

    Conference29th International Joint Conference on Artificial Intelligence, IJCAI 2020
    Country/TerritoryJapan
    CityYokohama
    Period1/01/21 → …

    ASJC Scopus subject areas

    • Artificial Intelligence

    Fingerprint

    Dive into the research topics of 'Multi-directional heuristic search'. Together they form a unique fingerprint.

    Cite this