Dynamically improved bounds bidirectional search

摘要: Abstract This paper presents a bidirectional search algorithm that dynamically improves the bounds during its execution. It has property it always terminates on or before forward meets backward search. Computational experiments pancake problem, sliding tile puzzle, and topspin problem demonstrate is capable of solving problems using significantly fewer node expansions than A⁎ state-of-the-art algorithms such as MMϵ GBFHS.