A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm
[chapter]
2000
Lecture Notes in Computer Science
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
doi:10.1007/3-540-39963-1_23
fatcat:bqrqfej5rzaslgf57b2wflg6wu