TY - GEN
T1 - Bidirectional heuristic search
T2 - 29th International Joint Conference on Artificial Intelligence, IJCAI 2020
AU - Shperberg, Shahaf S.
AU - Felner, Ariel
AU - Sturtevant, Nathan R.
AU - Shimony, Eyal
AU - Hayoun, Avi
N1 - Publisher Copyright: © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - Recent work on bidirectional search defined a lower bound on costs of paths between pairs of nodes, and introduced a new algorithm, NBS, which is based on this bound. Building on these results, we introduce DVCBS, a new algorithm that aims to to further reduce the number of expansions. Generalizing beyond specific algorithms, we then propose a method for enhancing heuristics by propagating such lower bounds (lb-propagation) between frontiers. This lb-propagation can be used in existing algorithms, often improving their performance, as well as making them”well behaved”.
AB - Recent work on bidirectional search defined a lower bound on costs of paths between pairs of nodes, and introduced a new algorithm, NBS, which is based on this bound. Building on these results, we introduce DVCBS, a new algorithm that aims to to further reduce the number of expansions. Generalizing beyond specific algorithms, we then propose a method for enhancing heuristics by propagating such lower bounds (lb-propagation) between frontiers. This lb-propagation can be used in existing algorithms, often improving their performance, as well as making them”well behaved”.
UR - http://www.scopus.com/inward/record.url?scp=85097339735&partnerID=8YFLogxK
M3 - Conference contribution
T3 - IJCAI International Joint Conference on Artificial Intelligence
SP - 4775
EP - 4779
BT - Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020
A2 - Bessiere, Christian
Y2 - 1 January 2021
ER -