Partial order reduction techniques are successfully used for various settings in planning,
such as classical planning with A* search or with decoupled search, fully-observable non …

Stubborn sets are an optimality-preserving pruning technique for factored state-space
search, for example in classical planning. Their applicability is limited by their computational …

Decoupled search decomposes a classical planning task by partitioning its variables such
that the dependencies between the resulting factors form a star topology. In this topology, a …

State-space search is a widely employed concept in many areas of computer science. The
well-known state explosion problem, however, imposes a severe limitation to the effective …

Stubborn sets are a pruning technique for state-space search which is well established in
optimal classical planning. In this paper, we show that weak stubborn sets introduced in …

Decoupled search is a state space search method originally introduced in AI Planning.
Similar to partial-order reduction methods, decoupled search exploits the independence of …

In classical planning as search, duplicate state pruning is a standard method to avoid
unnecessarily handling the same state multiple times. In decoupled search, similar to …