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


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
Issue number1
StatePublished - 1 Jan 2023
Event33rd International Conference on Automated Planning and Scheduling, ICAPS 2023 - Prague, Czech Republic
Duration: 8 Jul 202313 Jul 2023

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems and Management


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

Cite this