hm(P) = h1{Pm: Alternative characterisations of the generalisation from hmax to hm

Patrik Haslum

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

Patrik Haslum^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › peer-review

31 Citations (Scopus)

Abstract

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

Original language	English
Title of host publication	ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling
Pages	354-357
Number of pages	4
Publication status	Published - 2009
Event	19th International Conference on Automated Planning and Scheduling, ICAPS 2009 - Thessaloniki, Greece Duration: 19 Sept 2009 → 23 Sept 2009

Publication series

Name	ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

Conference

Conference	19th International Conference on Automated Planning and Scheduling, ICAPS 2009
Country/Territory	Greece
City	Thessaloniki
Period	19/09/09 → 23/09/09

Cite this

@inproceedings{057d9c51208b4b80a0d9a8727442f251,

title = "hm(P) = h1{Pm: Alternative characterisations of the generalisation from hmax to hm",

abstract = "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 cost splitting.",

author = "Patrik Haslum",

year = "2009",

language = "English",

isbn = "9781577354062",

series = "ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling",

pages = "354--357",

booktitle = "ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling",

note = "19th International Conference on Automated Planning and Scheduling, ICAPS 2009 ; Conference date: 19-09-2009 Through 23-09-2009",

}

Haslum, P 2009, h^m(P) = h¹{P^m: Alternative characterisations of the generalisation from h^max to h^m. in ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling. ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling, pp. 354-357, 19th International Conference on Automated Planning and Scheduling, ICAPS 2009, Thessaloniki, Greece, 19/09/09.

h^m(P) = h¹{P^m: Alternative characterisations of the generalisation from h^max to h^m. / Haslum, Patrik.
ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling. 2009. p. 354-357 (ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › peer-review

TY - GEN

T1 - hm(P) = h1{Pm

T2 - 19th International Conference on Automated Planning and Scheduling, ICAPS 2009

AU - Haslum, Patrik

PY - 2009

Y1 - 2009

N2 - 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 cost splitting.

AB - 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 cost splitting.

UR - http://www.scopus.com/inward/record.url?scp=77956040902&partnerID=8YFLogxK

M3 - Conference Paper

SN - 9781577354062

T3 - ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

SP - 354

EP - 357

BT - ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

Y2 - 19 September 2009 through 23 September 2009

ER -

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

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this