@inproceedings{aa359721f30442f79000968908c8d735,
title = "Optimal search with inadmissible heuristics",
abstract = "Considering cost-optimal heuristic search, we introduce the notion of global admissibility of a heuristic, a property weaker than standard admissibility, yet sufficient for guaranteeing solution optimality within forward search. We describe a concrete approach for creating globally admissible heuristics for domain independent planning; it is based on exploiting information gradually gathered by the search via a new form of reasoning about what we call existential optimal-plan landmarks. We evaluate our approach on some state-of-the-art heuristic search tools for cost-optimal planning, and discuss the results of this evaluation.",
author = "Erez Karpas and Carmel Domshlak",
year = "2012",
doi = "https://doi.org/10.1609/icaps.v22i1.13499",
language = "الإنجليزيّة",
isbn = "9781577355625",
series = "ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling",
pages = "92--100",
booktitle = "ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling",
note = "22nd International Conference on Automated Planning and Scheduling, ICAPS 2012 ; Conference date: 25-06-2012 Through 29-06-2012",
}