Cost-Optimal Planning with Landmarks

Karpas, Erez; Domshlak, Carmel

Cost-Optimal Planning with Landmarks

Download BibTeX Cite

Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 1728-1732.

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

Erez Karpas, and Carmel Domshlak. 2009. Cost-Optimal Planning with Landmarks. In Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09. IJCAI, 1728–1732. https://ijcai.org/proceedings/2009/288

@inproceedings{ijcai2009p288,
  title     = {Cost-Optimal Planning with Landmarks},
  author    = {Karpas, Erez and Domshlak, Carmel},
  booktitle = {Proceedings of the Twenty-First International Joint Conference on
               Artificial Intelligence, {IJCAI-09}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Hiroaki Kitano},
  pages     = {1728--1732},
  year      = {2009},
  url       = {https://ijcai.org/proceedings/2009/288},
}

TY  - CPAPER
TI  - Cost-Optimal Planning with Landmarks
AU  - Karpas, Erez
AU  - Domshlak, Carmel
T2  - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2009
SP  - 1728
EP  - 1732
UR  - https://ijcai.org/proceedings/2009/288
ER  -