arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.2200cs.AI
收藏

启发式算法与A* 搜索的不一致性和准确性

Inconsistency and Accuracy of Heuristics with A* Search

Indiana University South Bend(印第安纳大学南本德分校);MathWorks(迈斯沃克)

Hang Dinh, Hieu Dinh

摘要:

启发式搜索的许多研究表明,使用的启发式的准确性有积极的影响,提高搜索的性能。在另一个方向上,历史研究认为,启发式搜索算法的性能,如A* 和IDA*,可以通过要求启发式算法是一致的来提高-任何完美的启发式算法都能满足的属性。然而,最近的一些研究表明,不一致算法也可以用来实现这些启发式搜索算法的大的改进。这些结果给我们留下了一个自然的问题:在构建算法时,我们应该关注算法的哪个属性,准确性或一致性/不一致性?虽然有研究的启发式的准确性与假设的一致性,没有研究的不一致性和准确性的启发式是已知的,我们的知识。在这项研究中,我们调查的不一致性和准确性之间的关系,与A* 搜索。我们的分析结果揭示了这两个属性之间的相关性。然后,我们运行的背包问题的域上的一个家庭的实际的economistics实验。我们的实证结果表明,在许多情况下,更准确的算法也有更高的不一致性,并导致更少的节点扩展A*。

英文摘要:

Many studies in heuristic search suggest that the accuracy of the heuristic used has a positive impact on improving the performance of the search. In another direction, historical research perceives that the performance of heuristic search algorithms, such as A* and IDA*, can be improved by requiring the heuristics to be consistent -- a property satisfied by any perfect heuristic. However, a few recent studies show that inconsistent heuristics can also be used to achieve a large improvement in these heuristic search algorithms. These results leave us a natural question: which property of heuristics, accuracy or consistency/inconsistency, should we focus on when building heuristics? While there are studies on the heuristic accuracy with the assumption of consistency, no studies on both the inconsistency and the accuracy of heuristics are known to our knowledge. In this study, we investigate the relationship between the inconsistency and the accuracy of heuristics with A* search. Our analytical result reveals a correlation between these two properties. We then run experiments on the domain for the Knapsack problem with a family of practical heuristics. Our empirical results show that in many cases, the more accurate heuristics also have higher level of inconsistency and result in fewer node expansions by A*.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑