Structural-Pattern Databases

10 years 23 days ago
Structural-Pattern Databases
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of these abstraction heuristics is that the size of the abstract space has to be bounded by a (large) constant. Targeting this issue, Katz and Domshlak (2008b) introduced structural, articular fork-decomposition, abstractions, in which ning task is abstracted by an instance of a tractable fragment of optimal planning. At first view, however, the lunch was not free. Some of the power of the explicit abstraction heuristics comes from pre-computing the heuristic function offline, and then determine h(s) for each evaluated state s by a very fast lookup in a "database". In contrast, fork-decomposition offer a poly-time, yet far from being fast, computation. In this contribution, we show that the time-per-node complexity bottleneck of the fork-decomposition heuristics can be successfully overcome. Specificall...
Michael Katz, Carmel Domshlak
Added 08 Nov 2010
Updated 08 Nov 2010
Type Conference
Year 2009
Where AIPS
Authors Michael Katz, Carmel Domshlak
Comments (0)