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

中文翻译：

---

动态改进的边界双向搜索

摘要 本文提出了一种双向搜索算法，该算法在其执行过程中动态改进边界。它具有总是在前向搜索遇到后向搜索时或之前终止的属性。对煎饼问题、滑动瓷砖拼图和上旋问题的计算实验表明，它能够使用比 A⁎ 或最先进的双向算法（如 MMϵ 和 GBFHS）少得多的节点扩展来解决问题。