Counterexample-guided abstraction refinement (CEGAR) is a method for incrementally
computing abstractions of transition systems. We propose a CEGAR algorithm for computing …

Cost partitioning is a method for admissibly combining a set of admissible heuristic
estimators by distributing operator costs among the heuristics. Computing an optimal cost …

Operator cost partitioning is a well-known technique to make admissible heuristics additive
by distributing the operator costs among individual heuristics. Planning tasks are usually …

The merge-and-shrink framework has been introduced as a general approach for defining
abstractions of large state spaces arising in domain-independent planning and related …

Many heuristics for cost-optimal planning are based on linear programming. We cover
several interesting heuristics of this type by a common framework that fixes the objective …

The iPDB procedure by Haslum et al. is the stateof-the-art method for computing additive
abstraction heuristics for domain-independent planning. It performs a hill-climbing search in …

A pattern database (PDB) for a planning task is a heuristic function in the form of a lookup
table that contains optimal solution costs of a simplified version of the task. In this paper we …

State-space search with explicit abstraction heuristics is at the state of the art of cost-optimal
planning. These heuristics are inherently limited, nonetheless, because the size of the …

In this paper we address the following search task: find a goal with cost smaller than or
equal to a given fixed constant. This task is relevant in scenarios where a fixed budget is …

While in classical planning the objective is to achieve one of the equally attractive goal
states at as low total action cost as possible, the objective in deterministic oversubscription …