O-Plan: the open planning architecture
Artificial Intelligence
A theory of conflict resolution in planning
Artificial Intelligence - Special volume on constraint-based reasoning
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Multi-contributor causal structures for planning: a formalization and evaluation
Artificial Intelligence
Least-cost flaw repair: a plan refinement strategy for partial-order planning
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Temporal planning with continuous change
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Artificial Intelligence - Special volume on planning and scheduling
Accelerating Partial Order Planners by Improving Plan and Goal Choices
Accelerating Partial Order Planners by Improving Plan and Goal Choices
Passive and active decision postponement in plan generation
Passive and active decision postponement in plan generation
Bridging the gap between planning and scheduling
The Knowledge Engineering Review
Branching and pruning: an optimal temporal POCL planner based on constraint programming
Artificial Intelligence
Branching and pruning: an optimal temporal POCL planner based on constraint programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Flaw selection strategies for partial-order planning
Journal of Artificial Intelligence Research
Branching and pruning: An optimal temporal POCL planner based on constraint programming
Artificial Intelligence
Exploiting symmetry in lifted CSPs
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Intelligent ethical wealth planner: a multi-agent approach
PRICAI'12 Proceedings of the 12th Pacific Rim international conference on Trends in Artificial Intelligence
Hi-index | 0.00 |
Partial-Order Causal Link planners typically take a "least-commitment" approach to some decisions (notably, step ordering), postponing those decisions until constraints force them to be made. However, these planners rely to some degree on early commitments in making other types of decisions, including threat resolution and operator choice. We show why existing planners cannot support full least-commitment decisionmaking, and present an alternative approach that can. The approach has been implemented in the Descartes system, which we describe. We also provide experimental results that demonstrate that a least-commitment approach to planning can be profitably extended beyond what is done in POCL and similar planners, but that taking a least-commitment approach to every planning decision can be inefficient: early commitment in plan generation is sometimes a good idea.