Enriching Non-Parametric Bidirectional Search Algorithms
2019 ◽
Vol 33
◽
pp. 2379-2386
Keyword(s):
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.
2008 ◽
Vol 105
(40)
◽
pp. 15253-15257
◽
2010 ◽
Vol 5
(1)
◽
pp. 78-88
◽
2017 ◽
Vol 59
◽
pp. 463-494
◽
Keyword(s):
2020 ◽
Vol 34
(09)
◽
pp. 13700-13703
2020 ◽
Vol 34
(03)
◽
pp. 2327-2334