.png){kind=icon}
返回
Dynamically improved bounds bidirectional search
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2020.103405.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 MME and GBFHS. (c) 2020 Elsevier B.V. All rights reserved.
Keyword:
Heuristic search
Bidirectional search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容