Główne pojęcia
The authors propose a new computational problem called partially ordered top-quality planning, which allows specifying a subset of actions whose ordering in the plan is important, interpolating between the two extremes of considering all orders important or all orders unimportant.
Streszczenie
The authors introduce the problem of partially ordered top-quality planning, which allows specifying a subset of actions whose ordering in the plan is important. This interpolates between the two extremes of considering all orders important (top-quality planning) or all orders unimportant (unordered top-quality planning).
The motivation behind this new problem is threefold:
- Under-specified action models, where only one order may produce the desired solution.
- Action ordering preferences that users wish to impose, but are not exposed in the planning model.
- Known unimportant orderings, such as between bookkeeping or auxiliary actions.
The authors propose three computational approaches to solve this new problem:
- A simple baseline of post-processing the results of a top-quality planner.
- Leveraging successor pruning techniques through modification to the partial order reduction algorithm.
- Inspecting the reduced set of successor actions to ensure safety for partially ordered top-quality planning.
The authors prove the necessary theoretical guarantees for safe pruning and the use of partial order reduction in the proposed approaches. They also provide an experimental evaluation demonstrating the benefits of exploiting such techniques in this setting.