Optimal planning for delete-free tasks with incremental LM-cut

Pommerening, Florian and Helmert, Malte. (2012) Optimal planning for delete-free tasks with incremental LM-cut. In: Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012). Atibaia, pp. 363-367.

[img] PDF - Published Version

Official URL: http://edoc.unibas.ch/dok/A6043818

Downloads: Statistics Overview


Optimal plans of delete-free planning tasks are interesting both in domains that have no delete effects and as the relaxation heuristic h+ in general planning. Many heuristics for optimal and satisficing planning approximate the h+ heuristic, which is well-informed and admissible but intractable to compute. In this work, branch-and-bound and IDA* search are used in a search space tailored to delete-free planning together with an incrementally computed version of the LM-cut heuristic. The resulting algorithm for optimal delete-free planning exceeds the performance of A* with the LM-cut heuristic in the state-of-the-art planner Fast Downward.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Helmert, Malte and Pommerening, Florian
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
edoc DOI:
Last Modified:16 Oct 2018 13:23
Deposited On:13 Sep 2013 07:57

Repository Staff Only: item control page