DagSemProc.09491.3.pdf
- Filesize: 107 kB
- 2 pages
Document
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9491
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2010-03-02
Cite AsGet BibTex
Malte Helmert and Carmel Domshlak. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?. In Graph Search Engineering. Dagstuhl Seminar Proceedings, Volume 9491, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.09491.3
https://doi.org/10.4230/DagSemProc.09491.3
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.
Keywords
- Planning
- heuristic search
- heuristic functions
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads