加法模式数据库启发式算法
Additive Pattern Database Heuristics
摘要:
我们探讨了一种方法计算可容许的启发式评价函数的搜索问题。它利用模式数据库,这是预先计算的解决现有问题的各种子问题的确切成本表。然而,与标准模式数据库算法不同的是,我们将问题划分为不相交的子问题,这样解决不同子问题的成本就可以加在一起,而不会高估解决原始问题的成本。在前面,我们展示了如何静态地将滑动瓦片谜题划分为不相交的瓦片组来计算可接受的启发式,对每个状态和问题实例使用相同的分区。在这里,我们扩展的方法,并表明它也适用于其他领域。我们还提出了另一种方法,我们称之为动态分区模式数据库的加法模式。在这里,我们分区的问题为每个状态的搜索动态不相交的子问题。我们讨论了这些方法的优点和缺点,并将这两种方法应用到三个不同的问题域:滑动瓦片难题,4钉塔的河内问题,并找到一个最佳的顶点覆盖图。我们发现,在某些问题域,静态分区是最有效的,而在其他动态分区是一个更好的选择。在这些问题域中的每一个中,静态分区或动态分区的模式数据库算法是问题的最佳已知算法。
英文摘要:
We explore a method for computing admissible heuristic evaluation functions for search problems. It utilizes pattern databases, which are precomputed tables of the exact cost of solving various subproblems of an existing problem. Unlike standard pattern database heuristics, however, we partition our problems into disjoint subproblems, so that the costs of solving the different subproblems can be added together without overestimating the cost of solving the original problem. Previously, we showed how to statically partition the sliding-tile puzzles into disjoint groups of tiles to compute an admissible heuristic, using the same partition for each state and problem instance. Here we extend the method and show that it applies to other domains as well. We also present another method for additive heuristics which we call dynamically partitioned pattern databases. Here we partition the problem into disjoint subproblems for each state of the search dynamically. We discuss the pros and cons of each of these methods and apply both methods to three different problem domains: the sliding-tile puzzles, the 4-peg Towers of Hanoi problem, and finding an optimal vertex cover of a graph. We find that in some problem domains, static partitioning is most effective, while in others dynamic partitioning is a better choice. In each of these problem domains, either statically partitioned or dynamically partitioned pattern database heuristics are the best known heuristics for the problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。