Cost-Optimal Planning with Landmarks. Karpas, E. & Domshlak, C. In 2009. abstract bibtex 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.
@inproceedings{karpas_cost-optimal_2009,
title = {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.},
language = {en},
author = {Karpas, Erez and Domshlak, Carmel},
year = {2009},
}
Downloads: 0
{"_id":{"_str":"51f90bc9c5b22c3876000215"},"__v":9,"authorIDs":["5459012fb43425b7720002d7","548bf0472e5d16b075000909"],"author_short":["Karpas, E.","Domshlak, C."],"bibbaseid":"karpas-domshlak-costoptimalplanningwithlandmarks-2009","bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"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.","language":"en","author":[{"propositions":[],"lastnames":["Karpas"],"firstnames":["Erez"],"suffixes":[]},{"propositions":[],"lastnames":["Domshlak"],"firstnames":["Carmel"],"suffixes":[]}],"year":"2009","bibtex":"@inproceedings{karpas_cost-optimal_2009,\n\ttitle = {Cost-{Optimal} {Planning} with {Landmarks}},\n\tabstract = {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.},\n\tlanguage = {en},\n\tauthor = {Karpas, Erez and Domshlak, Carmel},\n\tyear = {2009},\n}\n\n\n\n\n\n\n\n","author_short":["Karpas, E.","Domshlak, C."],"key":"karpas_cost-optimal_2009","id":"karpas_cost-optimal_2009","bibbaseid":"karpas-domshlak-costoptimalplanningwithlandmarks-2009","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/matteocarde","downloads":0,"keywords":[],"search_terms":["cost","optimal","planning","landmarks","karpas","domshlak"],"title":"Cost-Optimal Planning with Landmarks","title_words":["cost","optimal","planning","landmarks"],"year":2009,"dataSources":["2BpB8mn6afrq99CyN","BLJPWpPi3hneTGaPF"]}