Skip navigation
Skip navigation

Flexible abstraction heuristics for optimal sequential planning

Helmert, Malte; Haslum, Patrik; Hoffmann, Joerg


We describe an approach to deriving consistent heuristics for automated planning, based on explicit search in abstract state spaces. The key to managing complexity is interleaving composition of abstractions over different sets of state variables with abstraction of the partial composites. The approach is very general and can be instantiated in many different ways by following different abstraction strategies. In particular, the technique subsumes planning with pattern databases as a special...[Show more]

CollectionsANU Research Publications
Date published: 2007
Type: Conference paper
Source: Proceedings of The 17th International Conference on Automated Planning and Scheduling (ICAPS 2007)


File Description SizeFormat Image
01_Helmert_Flexible_abstraction_2007.pdf194.58 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator