Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions

IJCAI, 2017.

被引用24|引用|浏览22
EI
其它链接dblp.uni-trier.de|academic.microsoft.com|arxiv.org

摘要

It is well-known that any admissible unidirectional heuristic search algorithm must expand all states whose $f$-value is smaller than the optimal solution cost when using a consistent heuristic. Such states are called surely expanded (s.e.). A recent study characterized s.e. pairs of states for bidirectional search with consistent heurist...更多

代码

数据

下载 PDF 全文
您的评分 :
0

 

标签
评论