Planning for conjunctive goals
Artificial Intelligence
Complete Determination of Parallel Actions and Temporal Optimization in Linear Plans of Action
EWSP '91 Proceedings of the European Workshop on Planning
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
A distributed framework for solving the Multiagent Plan Coordination Problem
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Learning first-order definitions of functions
Journal of Artificial Intelligence Research
Reviving partial order planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Plan quality optimisation via block decomposition
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Partially ordered plans have several useful properties, such as exhibiting the structure of the plan more clearly which facilitates post-plan generation tasks like scheduling the plan, explaining it to a user, or breaking it into subplans for distributed execution. The standard interpretation of partial ordering implies that whenever two subplans are unordered, every interleaving of steps from the two forms a valid execution. This restricts deordering to cases where individual steps (i.e., actions) are independent. We propose a weaker notion of partial ordering that divides the plan into blocks, such that the steps in a block may not be interleaved with steps outside the block, but unordered blocks can be executed in any sequence. We present an algorithm to find such deorderable blocks, and show that it enables deordering plans in many cases where no deordering is possible under the standard interpretation.