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

使用条件分布预测IDA * 的性能

Predicting the Performance of IDA* using Conditional Distributions

Bar-Ilan University(巴伊兰大学);Ben-Gurion University(本-古里安大学);University of Alberta(阿尔伯塔大学)

Uzi Zahavi, Ariel Felner, Neil Burch, Robert C. Holte

摘要:

Korf、Reid和Edelkamp引入了一个公式来预测IDA* 在给定的一致性启发式算法的单次迭代中将扩展的节点数,并通过实验证明它可以做出非常准确的预测。在本文中,我们表明,除了要求启发式是一致的,他们的公式预测是准确的,只有在暴力搜索树的启发式值服从无条件分布,他们定义,然后在他们的公式中使用的水平。然后,我们提出了一个新的公式,没有这些要求,即,对于启发式算法不一致的情况,以及启发式算法在任一层的值不服从无条件分布的情况,该算法都能准确地预测出IDA算法的性能。为了实现这一目标,我们引入了启发式值的条件分布,这是其无条件启发式分布的推广。我们还提供了扩展我们的公式,处理个人的开始状态和增加IDA* 与双向pathmax(BPMX),传播启发式的值时,不一致的启发式的技术。实验结果证明了我们的新方法及其所有变化的准确性。

英文摘要:

Korf, Reid, and Edelkamp introduced a formula to predict the number of nodes IDA* will expand on a single iteration for a given consistent heuristic, and experimentally demonstrated that it could make very accurate predictions. In this paper we show that, in addition to requiring the heuristic to be consistent, their formulas predictions are accurate only at levels of the brute-force search tree where the heuristic values obey the unconditional distribution that they defined and then used in their formula. We then propose a new formula that works well without these requirements, i.e., it can make accurate predictions of IDA*s performance for inconsistent heuristics and if the heuristic values in any level do not obey the unconditional distribution. In order to achieve this we introduce the conditional distribution of heuristic values which is a generalization of their unconditional heuristic distribution. We also provide extensions of our formula that handle individual start states and the augmentation of IDA* with bidirectional pathmax (BPMX), a technique for propagating heuristic values when inconsistent heuristics are used. Experimental results demonstrate the accuracy of our new method and all its variations.

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

↑