Accuracy of admissible heuristic functions in selected planning domains

Authors:
Malte Helmert;Robert Mattmüller
Affiliations:
Albert-Ludwigs-Universität Freiburg, Germany;Albert-Ludwigs-Universität Freiburg, Germany
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Year:
2008

Citing 10
Cited 7

The computational complexity of propositional STRIPS planning

Artificial Intelligence
Planning as heuristic search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Unifying SAT-based and Graph-based Planning

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
New admissible heuristics for domain-independent planning

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Domain-independent construction of pattern database heuristics for cost-optimal planning

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
The 3rd international planning competition: results and analysis

Journal of Artificial Intelligence Research
The deterministic part of IPC-4: an overview

Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks

Journal of Artificial Intelligence Research
Understanding planning tasks: domain complexity and heuristic decomposition

Understanding planning tasks: domain complexity and heuristic decomposition
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

Set-structured and cost-sharing heuristics for classical planning

Annals of Mathematics and Artificial Intelligence
Friends or foes? on planning as satisfiability and abstract CNF encodings

Journal of Artificial Intelligence Research
Planning with h+in theory and practice

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Optimal admissible composition of abstraction heuristics

Artificial Intelligence
Implicit abstraction heuristics

Journal of Artificial Intelligence Research
Computing perfect heuristics in polynomial time: on bisimulation and merge-and-shrink abstraction in optimal planning

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
The complexity of optimal monotonic planning: the bad, the good, and the causal graph

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficiency of optimal planning algorithms based on heuristic search crucially depends on the accuracy of the heuristic function used to guide the search. Often, we are interested in domain-independent heuristics for planning. In order to assess the limitations of domain-independent heuristic planning, we analyze the (in)accuracy of common domain-independent planning heuristics in the IPC benchmark domains. For a selection of these domains, we analytically investigate the accuracy of the h+ heuristic, the hm family of heuristics, and certain (additive) pattern database heuristics, compared to the perfect heuristic h*. Whereas h+and additive pattern database heuristics usually return cost estimates proportional to the true cost, non-additive hm and nonadditive pattern-database heuristics can yield results underestimating the true cost by arbitrarily large factors.