Ariel Felner
Senior Academic
W-restrained Bidirectional Bounded-Suboptimal Heuristic Search
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.
| Publication language | English |
| Pages | 26-30 |
| Journal | Proceedings International Conference on Automated Planning and Scheduling, ICAPS |
| Volume | 33 |
| Issue number | 1 |
| Publication status | Published - 01.01.2023 |
ASJC Scopus subject areas
Artificial Intelligence
Computer Science Applications
Information Systems and Management
