Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning
Preprint
Abstract
The ability to generate multiple plans is central to using planning in real-life applications. Top-quality planners generate sets of such top-cost plans, allowing flexibility in determining equivalent ones. In terms of the order between actions in a plan, the literature only considers two extremes -- either all orders are important, making each plan unique, or all orders are unimportant, treating two plans differing only in the order of actions as equivalent. To allow flexibility in selecting important orders, we propose specifying a subset of actions the orders between which are important, interpolating between the top-quality and unordered top-quality planning problems. We explore the ways of adapting partial order reduction search pruning techniques to address this new computational problem and present experimental evaluations demonstrating the benefits of exploiting such techniques in this setting.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- K∗ and Partial Order Reduction for Top-Quality PlanningProceedings of the International Symposium on Combinatorial Search, 2023
- On K* Search for Top-K PlanningProceedings of the International Symposium on Combinatorial Search, 2023
- Reshaping Diverse PlanningProceedings of the AAAI Conference on Artificial Intelligence, 2020
- Top-Quality Planning: Finding Practically Useful Sets of Best PlansProceedings of the AAAI Conference on Artificial Intelligence, 2020
- Symbolic Top-k PlanningProceedings of the AAAI Conference on Artificial Intelligence, 2020
- Generating diverse plans to handle unknown and partially known user preferencesArtificial Intelligence, 2012
- Soft Goals Can Be Compiled AwayJournal of Artificial Intelligence Research, 2009
- The Fast Downward Planning SystemJournal of Artificial Intelligence Research, 2006