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

合理部署CSP启发式算法

Rational Deployment of CSP Heuristics

Ben-Gurion University of the Negev(内盖夫本-古里安大学)

David Tolpin, Solomon Eyal Shimony

摘要:

启发式是减少人工智能各个领域搜索工作的重要工具。为了有效,启发式算法必须能够有效地计算,并为搜索算法提供有用的信息。然而,一些在减少回溯方面做得很好的著名算法是如此之重,以至于在搜索算法中部署它们的收益可能会被它们的开销所抵消。我们提出了一个合理的元推理方法来决定何时部署物流,使用CSP回溯搜索作为案例研究。特别是,一个信息的价值的方法是采取自适应部署的解决方案计数估计算法的价值排序。实证结果表明,确实所提出的机制成功地平衡了减少回溯和启发式计算开销之间的权衡,从而导致显着的整体搜索时间减少。

英文摘要:

Heuristics are crucial tools in decreasing search effort in varied fields of AI. In order to be effective, a heuristic must be efficient to compute, as well as provide useful information to the search algorithm. However, some well-known heuristics which do well in reducing backtracking are so heavy that the gain of deploying them in a search algorithm might be outweighed by their overhead. We propose a rational metareasoning approach to decide when to deploy heuristics, using CSP backtracking search as a case study. In particular, a value of information approach is taken to adaptive deployment of solution-count estimation heuristics for value ordering. Empirical results show that indeed the proposed mechanism successfully balances the tradeoff between decreasing backtracking and heuristic computational overhead, resulting in a significant overall search time reduction.

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

↑