Proceedings of the International Conference on Automated Planning and Scheduling · 2009 · 399 citations · 21 references
ComputingComputer ScienceAlgorithmsOptimizationPath PlanningCritical Path AnalysisHeuristic OptimizationHeuristic SearchAbstraction HeuristicsAdmissible HeuristicsHeuristic AlgorithmsLandmark Heuristics
Current heuristic estimators for classical domain-independent planning are usually based on one of four ideas: delete relaxations, critical paths, abstractions, and, most recently, landmarks. Previously, these different ideas for deriving heuristic functions were largely unconnected.We prove that admissible heuristics based on these ideas are in fact very closely related. Exploiting this relationship, we introduce a new admissible heuristic called the landmark cut heuristic, which compares favourably with the state of the art in terms of heuristic accuracy and overall performance.
21
Blai Bonet, Héctor Geffner · Artificial Intelligence · 2001 · 961 citations · Full text
The computational complexity of propositional STRIPS planning
Tom Bylander · Artificial Intelligence · 1994 · 863 citations
Admissible heuristics for optimal planning
Patrik Haslum, Héctor Geffner · 2000 · 311 citations