Combinatorial reconfiguration is the problem of transforming one solution of a combinatorial
problem into another, where each transformation may only apply small changes to a solution …

Finding multiple high-quality plans is essential in many planning applications, and top-k
planning asks for finding the k best plans, naturally extending cost-optimal classical …

In top-k planning, the objective is to determine a set of k cheapest plans that provide several
good alternatives to choose from. Such a solution set often contains plans that visit at least …

SymK is a planner that performs symbolic search using Binary Decision Diagrams to find a
single optimal or the best k plans. It is designed to be a versatile planner by supporting …

Stackelberg planning is a recent framework where a leader and a follower each choose a
plan in the same planning task, the leader's objective being to maximize plan cost for the …

Symbolic search has proven to be a useful approach to optimal classical planning. In
Hierarchical Task Network (HTN) planning, however, there is little work on optimal planning …

Abstract Symbolic search, using Binary Decision Diagrams (BDDs) to represent sets of
states, is a competitive approach to optimal planning. Yet heuristic search in this context …

Heuristic search guides the exploration of states via heuristic functions h estimating
remaining cost. Symbolic search instead replaces the exploration of individual states with …

The objective of optimal oversubscription planning is to find a plan that yields an end state
with a maximum utility while keeping plan cost under a certain bound. In practice, the …

Currently, one of the predominant approaches for optimal classical planning is A* search
with heuristics that partition action costs among several abstractions of the input planning …