Skip navigation
Skip navigation

h^m(P)= h^1(P^m): Alternative characterisations of the generalisation from h^max to h^mn

Haslum, Patrik


The hm (m = 1,...) family of admissible heuristics for STRIPS planning with additive costs generalise the hmax heuristic, which results when m = 1. We show that the step from h1 to hm can be made by changing the planning problem instead of the heuristic function. This furthers our understanding of the hm heuristic, and may inspire application of the same generalisation to admissible heuristics stronger than hmax. As an example, we show how it applies to the additive variant of hm obtained via...[Show more]

CollectionsANU Research Publications
Date published: 2009
Type: Conference paper
Source: Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling


File Description SizeFormat Image
01_Haslum_h^m(P)=_h^1(P^m):_Alternative_2009.pdf308.22 kBAdobe PDF    Request a copy
02_Haslum_h^m(P)=_h^1(P^m):_Alternative_2009.pdf169.65 kBAdobe PDF    Request a copy
03_Haslum_h^m(P)=_h^1(P^m):_Alternative_2009.pdf130.72 kBAdobe PDF    Request a copy
04_Haslum_h^m(P)=_h^1(P^m):_Alternative_2009.pdf4.66 MBAdobe 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