Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search
SOCS, pp. 139-140, 2016.
Bidirectional search algorithms interleave a search forward from the start state (start ) and a search backward (i.e. using reverse operators) from the goal state (goal). We say that the two searches “meet in the middle” if neither search expands a node whose g-value (in the given direction) exceeds C*/2 , where C* is the cost of an optim...More
Full Text (Upload PDF)
PPT (Upload PPT)