Cost-Optimal Planning with Landmarks
Abstract
Planning landmarks are facts that must be true at some point in every solution plan. Previous work has very successfully exploited planning landmarks in satisficing (non-optimal) planning. We propose a methodology for deriving admissible heuristic estimates for cost-optimal planning from a set of planning landmarks. The resulting heuristics fall into a novel class of multi-path dependent heuristics, and we present a simple best-first search procedure exploiting such heuristics. Our empirical evaluation shows that this framework favorably competes with the state-of-the-art of cost-optimal heuristic search. Erez Karpas, Carmel Domshlak
Cite
Text
Karpas and Domshlak. "Cost-Optimal Planning with Landmarks." International Joint Conference on Artificial Intelligence, 2009.Markdown
[Karpas and Domshlak. "Cost-Optimal Planning with Landmarks." International Joint Conference on Artificial Intelligence, 2009.](https://mlanthology.org/ijcai/2009/karpas2009ijcai-cost/)BibTeX
@inproceedings{karpas2009ijcai-cost,
title = {{Cost-Optimal Planning with Landmarks}},
author = {Karpas, Erez and Domshlak, Carmel},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2009},
pages = {1728-1733},
url = {https://mlanthology.org/ijcai/2009/karpas2009ijcai-cost/}
}