@article{Shperberg_Felner_Sturtevant_Shimony_Hayoun_2019, title={Enriching Non-Parametric Bidirectional Search Algorithms}, volume={33}, url={https://ojs.aaai.org/index.php/AAAI/article/view/4078}, DOI={10.1609/aaai.v33i01.33012379}, abstractNote={<p>NBS is a non-parametric bidirectional search algorithm proven to expand at most twice the number of node expansions required to verify the optimality of a solution. We introduce new variants of NBS that are aimed at finding all optimal solutions. We then introduce an algorithmic framework that includes NBS as a special case. Finally, we introduce DVCBS, a new algorithm in this framework 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.</p>}, number={01}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Shperberg, Shahaf S. and Felner, Ariel and Sturtevant, Nathan R. and Shimony, Solomon E. and Hayoun, Avi}, year={2019}, month={Jul.}, pages={2379-2386} }