Abstract
A collection of landmarks is complete if the cost of a minimum-cost hitting set equals h+ and there is a minimum-cost hitting set that is an optimal relaxed plan. We present an algorithm for generating a complete collection of landmarks and we show that this algorithm can be extended into effective polytime heuristics for optimal and satisficing planning. The new admissible heuristics are compared with current state-of-the-art heuristics for optimal planning on benchmark problems from the IPC. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.
Cite
CITATION STYLE
Bonet, B., & Castillo, J. (2011). A complete algorithm for generating landmarks. In ICAPS 2011 - Proceedings of the 21st International Conference on Automated Planning and Scheduling (pp. 315–318). https://doi.org/10.1609/icaps.v21i1.13482
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
