Skip to main content
Article thumbnail
Location of Repository

Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling h m (P)=h 1 (P m): Alternative Characterisations of the Generalisation From h max To h m

By Patrik Haslum


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 1 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

Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.