The objective of top-k planning is to determine a set of k different plans with lowest cost for a
given planning task. In practice, such a set of best plans can be preferred to a single best …

While cost-optimal planning aims at finding one best quality plan, top-k planning deals with
finding a set of solutions, such that no better quality solution exists outside that set. We …

Cost-optimal planning has not seen many successful approaches that work well across all
domains. Some costoptimal planners excel on some domains, while exhibiting less exciting …

The paper introduces a novel polynomial compilation technique for the sound and complete
removal of conditional effects in classical planning problems. Similar to Nebel's polynomial …

Symbolic bidirectional uniform-cost search is a prominent technique for cost-optimal
planning. Thus, the question whether it can be further improved by making use of heuristic …

Classical planning problems are defined using some specification language, such as PDDL.
The domain expert defines action schemas, objects, the initial state, and the goal. One key …

Symmetry Breaking in Deterministic Planning as Forward Search: Orbit Space Search
Algorithm Page 1 Symmetry Breaking in Deterministic Planning as Forward Search: Orbit …

This paper describes Baggy-a system which automatically transforms a PDDL
representation into a revised PDDL representation, solves the problem using the revised …

Symmetry breaking is a well-known method for search reduction. It identifies state-space
symmetries prior to search, and prunes symmetric states during search. A recent proposal …

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 …