{"type":"ScholarlyArticle","title":"Cost-Optimal Planning with Landmarks","authors":[{"name":"Erez Karpas","slug":"erez-karpas","given":"Erez","family":"Karpas","affiliation":""},{"name":"Carmel Domshlak","slug":"carmel-domshlak","given":"Carmel","family":"Domshlak","affiliation":""}],"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","doi":null,"url":"https://ijcai.org/proceedings/2009/288","pdf":"https://ijcai.org/proceedings/2009/0288.pdf","markdown":"https://ijcai.org/proceedings/2009/288.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/288","volume":{"slug":"2009","title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2009","url":"https://ijcai.org/proceedings/2009/","year":2009,"location":"Pasadena, California, USA","dates":"","editors":"Hiroaki Kitano","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":288,"pages":{"first":1728,"last":1732},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}