TY - JOUR
T1 - W-restrained Bidirectional Bounded-Suboptimal Heuristic Search
AU - Atzmon, Dor
AU - Shperberg, Shahaf S.
AU - Sabah, Netanel
AU - Felner, Ariel
AU - Sturtevant, Nathan R.
N1 - Funding Information:
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).
Publisher Copyright:
Copyright © 2023, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85169817834&partnerID=8YFLogxK
U2 - 10.1609/icaps.v33i1.27175
DO - 10.1609/icaps.v33i1.27175
M3 - Conference article
AN - SCOPUS:85169817834
SN - 2334-0835
VL - 33
SP - 26
EP - 30
JO - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
JF - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
IS - 1
T2 - 33rd International Conference on Automated Planning and Scheduling, ICAPS 2023
Y2 - 8 July 2023 through 13 July 2023
ER -