W-restrained Bidirectional Bounded-Suboptimal Heuristic Search

Dor Atzmon, Shahaf S. Shperberg, Netanel Sabah, Ariel Felner, Nathan R. Sturtevant

Research output: Contribution to journalConference articlepeer-review

Abstract

In this paper, we develop theoretical foundations for bidirectional bounded-suboptimal search (BiBSS) based on recent advancements in optimal bidirectional search. In addition, we introduce a BiBSS variant of the prominent meet-in-the-middle (MM) algorithm, called Weighted MM (WMM). We show that WMM has an interesting property of being Wrestrained, and study it empirically.

Original languageEnglish
Pages (from-to)26-30
Number of pages5
JournalProceedings International Conference on Automated Planning and Scheduling, ICAPS
Volume33
Issue number1
DOIs
StatePublished - 2023
Externally publishedYes
Event33rd International Conference on Automated Planning and Scheduling, ICAPS 2023 - Prague, Czech Republic
Duration: 8 Jul 202313 Jul 2023

Bibliographical note

Publisher Copyright:
Copyright © 2023, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Funding

This work was funded by the United States-Israel Binational Science Foundation (BSF) under grant numbers 2017692 and 2021643, and by the Canada CIFAR AI Chairs Program. We acknowledge the support of the Natural Sciences and Engineering Research Council of Canada (NSERC).

FundersFunder number
Natural Sciences and Engineering Research Council of Canada
British Skin Foundation2017692, 2021643
United States-Israel Binational Science Foundation

    Fingerprint

    Dive into the research topics of 'W-restrained Bidirectional Bounded-Suboptimal Heuristic Search'. Together they form a unique fingerprint.

    Cite this