Seipp, Jendrik and Helmert, Malte. (2014) Diverse and additive Cartesian abstraction heuristics. In: Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014): [held on June 21-26 in Portsmouth, New Hampshire, USA]. Palo Alto, Calif., pp. 289-297.
Full text not available from this repository.
Official URL: http://edoc.unibas.ch/dok/A6328941
Downloads: Statistics Overview
Abstract
We have recently shown how counterexample-guided abstraction refinement can be used to derive informative Cartesian abstraction heuristics for optimal classical planning. In this work we introduce two methods for producing diverse sets of heuristics within this framework, one based on goal facts, the other based on landmarks. In order to sum the heuristic estimates admissibly we present a novel way of finding cost partitionings for explicitly represented abstraction heuristics. We show that the resulting heuristics outperform other state-of-the-art abstraction heuristics on many benchmark domains.
Faculties and Departments: | 05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert) |
---|---|
UniBasel Contributors: | Seipp, Jendrik and Helmert, Malte |
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: | |
Last Modified: | 05 Jun 2015 08:52 |
Deposited On: | 05 Jun 2015 08:52 |
Repository Staff Only: item control page