TY - GEN
T1 - Enriching non-parametric bidirectional search algorithms - Extended abstract
AU - Shperberg, Shahaf S.
AU - Felner, Ariel
AU - Sturtevant, Nathan R.
AU - Shimony, Solomon E.
AU - Hayoun, Avi
N1 - Publisher Copyright:
Copyright © 2019, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2019/1/1
Y1 - 2019/1/1
N2 - NBS is a non-parametric bidirectional search algorithm, proved to expand at most twice the number of node expansions required to verify the optimality of a solution. We introduce DVCBS, a new algorithm based on a dynamic vertex cover that aims to further reduce the number of expansions. Unlike NBS, DVCBS does not have any worst-case bound guarantees, but in practice it outperforms NBS in verifying the optimality of solutions.
AB - NBS is a non-parametric bidirectional search algorithm, proved to expand at most twice the number of node expansions required to verify the optimality of a solution. We introduce DVCBS, a new algorithm based on a dynamic vertex cover that aims to further reduce the number of expansions. Unlike NBS, DVCBS does not have any worst-case bound guarantees, but in practice it outperforms NBS in verifying the optimality of solutions.
UR - https://www.scopus.com/pages/publications/85086833344
M3 - Conference contribution
AN - SCOPUS:85086833344
T3 - Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019
SP - 196
EP - 197
BT - Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019
A2 - Surynek, Pavel
A2 - Yeoh, William
PB - AAAI press
T2 - 12th International Symposium on Combinatorial Search, SoCS 2019
Y2 - 16 July 2019 through 17 July 2019
ER -