… l)lamfing whih, Graphl)lau is conrrrn(’d with (optimal) t)arallt,l plamfing. A new admissible
heuristic HSP alld HSPr (’flit b(, tlS(~(’l tO find good l)lans fast I)ttt not prow|hie opt.hnal plans. …

… a plan with minimum cost, ie, classical optimal planning. With slight abuse of notation, we
write PF(T ,s ,G ) and PCS(T ,s ,G ) for the Pareto front and coverage set of plans starting from a …

… The topic of this thesis is the development of methods for achieving effective search control
for domain-independent optimal planning through the construction of admissible heuristics. …

… Additive ensembles of admissible heuristics constitute the most general form of exploiting …
numerous admissible heuristics in optimal planning. However, the same set of heuristics can …

… admissible heuristics for domain independent planning; it is … optimalplan landmarks. We
evaluate our approach on some state-ofthe-art heuristic search tools for cost-optimal planning, …

… new search heuristic for propositional STRIPS planning that is based on transforming planning
… The linear programming heuristic is admissible for finding minimum length plans and can …

… can be used as an admissible heuristic for optimal planning. … on admissible heuristics for
optimal sequential planning, the flow… general planning problems, including cost-based planning …

… often results in poor heuristic estimates. As an … optimal solution is simply to stack the n −
1 blocks that are not on the table in the goal state in correct order, resulting in an optimal plan …

… Our focus is on admissible heuristics for state-space cost-optimal planning. Defined
formally, using the SAS+ representation, a cost-optimal planning problem is a tuple Π = 〈V,O,s0,s⋆, …

… We now focus on admissible heuristics that can be used to produce optimal plans.
Traditionally, efficient generation of optimal plans has received little attention in the planning …