Skip navigation
Skip navigation

Improving Heuristics Through Relaxed Search - An Analysis of TP4 and HSP in the 2004 Planning Competition

Haslum, Patrik


The hm admissible heuristics for (sequential and temporal) regression planning are defined by a parameterized relaxation of the optimal cost function in the regression search space, where the parameter m offers a trade-off between the accuracy and computational cost of the heuristic. Existing methods for computing the hm heuristic require time exponential in m, limiting them to small values (m ≤ 2). The hm heuristic can also be viewed as the optimal cost function in a relaxation of the search...[Show more]

CollectionsANU Research Publications
Date published: 2006
Type: Journal article
Source: Journal of Artificial Intelligence Research
DOI: 10.1613/jair.1885


File Description SizeFormat Image
01_Haslum_Improving_Heuristics_Through_2006.pdf434.01 kBAdobe PDF    Request a copy

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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator