TY - GEN
T1 - Optimal search with inadmissible heuristics
AU - Karpas, Erez
AU - Domshlak, Carmel
PY - 2012/1/1
Y1 - 2012/1/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84866443512
U2 - 10.1609/icaps.v22i1.13499
DO - 10.1609/icaps.v22i1.13499
M3 - Conference contribution
AN - SCOPUS:84866443512
SN - 9781577355625
T3 - ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling
SP - 92
EP - 100
BT - ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling
PB - AAAI press
T2 - 22nd International Conference on Automated Planning and Scheduling, ICAPS 2012
Y2 - 25 June 2012 through 29 June 2012
ER -