edoc

Counterexample-guided cartesian abstraction refinement and saturated cost partitioning for optimal classical planning

Seipp, Jendrik. Counterexample-guided cartesian abstraction refinement and saturated cost partitioning for optimal classical planning. 2018, Doctoral Thesis, University of Basel, Faculty of Science.

[img]
Preview
PDF
959Kb

Official URL: http://edoc.unibas.ch/diss/DissB_12638

Downloads: Statistics Overview

Abstract

Heuristic search with an admissible heuristic is one of the most prominent approaches to solving classical planning tasks optimally. In the first part of this thesis, we introduce a new family of admissible heuristics for classical planning, based on Cartesian abstractions, which we derive by counterexample-guided abstraction refinement. Since one abstraction usually is not informative enough for challenging planning tasks, we present several ways of creating diverse abstractions. To combine them admissibly, we introduce a new cost partitioning algorithm, which we call saturated cost partitioning. It considers the heuristics sequentially and uses the minimum amount of costs that preserves all heuristic estimates for the current heuristic before passing the remaining costs to subsequent heuristics until all heuristics have been served this way.
In the second part, we show that saturated cost partitioning is strongly influenced by the order in which it considers the heuristics. To find good orders, we present a greedy algorithm for creating an initial order and a hill-climbing search for optimizing a given order. Both algorithms make the resulting heuristics significantly more accurate. However, we obtain the strongest heuristics by maximizing over saturated cost partitioning heuristics computed for multiple orders, especially if we actively search for diverse orders.
The third part provides a theoretical and experimental comparison of saturated cost partitioning and other cost partitioning algorithms. Theoretically, we show that saturated cost partitioning dominates greedy zero-one cost partitioning. The difference between the two algorithms is that saturated cost partitioning opportunistically reuses unconsumed costs for subsequent heuristics. By applying this idea to uniform cost partitioning we obtain an opportunistic variant that dominates the original. We also prove that the maximum over suitable greedy zero-one cost partitioning heuristics dominates the canonical heuristic and show several non-dominance results for cost partitioning algorithms. The experimental analysis shows that saturated cost partitioning is the cost partitioning algorithm of choice in all evaluated settings and it even outperforms the previous state of the art in optimal classical planning.
Advisors:Helmert, Malte and Hoffmann, Jörg
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Seipp, Jendrik and Helmert, Malte
Item Type:Thesis
Thesis Subtype:Doctoral Thesis
Thesis no:12638
Thesis status:Complete
Bibsysno:Link to catalogue
Number of Pages:1 Online-Ressource (x, 142 Seiten)
Language:English
Identification Number:
Last Modified:28 Jun 2018 04:30
Deposited On:27 Jun 2018 14:00

Repository Staff Only: item control page