Affordable Access

Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?

Authors
Publication Date
Source
Dagstuhl Research Online Publication Server
Keywords
  • Planning, Heuristic Search, Heuristic Functions
  • Data Processing Computer Science
External links

Abstract

Current heuristic estimators for classical domain-independent planning are usually based on one of four ideas: delete relaxation, abstraction, critical paths, and, most recently, landmarks. Previously, these different ideas for deriving heuristic functions were largely unconnected. In my talk, I will show that these heuristics are in fact very closely related. Moreover, I will introduce a new admissible heuristic called the landmark cut heuristic which exploits this relationship. In our experiments, the landmark cut heuristic provides better estimates than other current admissible planning heuristics, especially on large problem instances.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments