hm(P) = h1(Pm): Alternative Characterisations of the Generalisation From hmax To hm

@inproceedings{Haslum2009hmPH,
  title={hm(P) = h1(Pm): Alternative Characterisations of the Generalisation From hmax To hm},
  author={Patrik Haslum},
  booktitle={ICAPS},
  year={2009}
}
The hm (m = 1, . . .) family of admissible heuristics for STRIPS planning with additive costs generalise the h heuristic, which results when m = 1. We show that the step from h 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 h. As an example, we show how it applies to the additive variant of hm obtained via cost… CONTINUE READING

Similar Papers

Loading similar papers…