Abstract
We present a new heuristic method to evaluate planning states, which is based on solving a relaxation of the planning problem. The solutions to the relaxed problem give a good estimate for the length of a real solution, and they can also be used to guide action selection during planning. Using these informations, we employ a search strategy that combines Hill-climbing with systematic search. The algorithm is complete on what we call deadlock-free domains. Though it does not guarantee the solution plans to be optimal, it does find close to optimal plans in most cases. Often, it solves the problems almost without any search at all. In particular, it outperforms all state-of-the-art planners on a large range of domains.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Blum and M. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2):279–298, 1997.
B. Bonet and H. Geffner. Planning as heuristic search: New results. In Proceedings of the 5th European Conference on Planning, pages 359–371, 1999.
B. Bonet, G. Loerincs, and H. Geffner. A robust and fast action selection mechanism for planning. In Proceedings of the 14th National Conference of the American Association for Artificial Intelligence, pages 714–719, 1997.
T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165–204, 1994.
J. Hoffmann. A heuristic for domain independent planning and its use in a fast greedy planning algorithm. Technical Report 133, Albert-Ludwigs-University Freiburg, 2000.
H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the 14th National Conference of the American Association for Artificial Intelligence, pages 1194–1201, 1996.
H. Kautz and B. Selman. Unifying SAT-based and graph-based planning. In Proceedings of the 16th International Joint Conference on Artificial Intelligence, pages 318–325, 1999.
J. Koehler, B. Nebel, J. Hoffmann, and Y. Dimopoulos. Extending planning graphs to an ADL subset. In Proceedings of the 4th European Conference on Planning, pages 273–285, 1997.
D. Long and M. Fox. Efficient implementation of the plan graph in STAN. Journal of Artificial Intelligence Research, 10:87–115, 1999.
D. McDermott. A heuristic estimator for means-ends analysis in planning. In Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems, pages 142–149, 1996.
B. Nebel, Y. Dimopoulos, and J. Koehler. Ignoring irrelevant facts and operators in plan generation. In Proceedings of the 4th European Conference on Planning, pages 338–350, 1997.
I. Refanidis and I. Vlahavas. GRT: A domain independent heuristic for strips worlds based on greedy regression tables. In Proceedings of the 5th European Conference on Planning, pages 346–358, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, J. (2000). A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm. In: Raś, Z.W., Ohsuga, S. (eds) Foundations of Intelligent Systems. ISMIS 2000. Lecture Notes in Computer Science(), vol 1932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39963-1_23
Download citation
DOI: https://doi.org/10.1007/3-540-39963-1_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41094-2
Online ISBN: 978-3-540-39963-6
eBook Packages: Computer ScienceComputer Science (R0)