Download:
|
by David Joslin, Martha E. Pollack
Proceedings of the Third European Conference on Planning
http://www.cs.pitt.edu/~pollack/distrib/ewsp95.ps
Add To MetaCart
Abstract:
Abstract. One of the strengths of Partial-Order Causal Link (POCL) planning is the ability to postpone decisions. But because postponed decisions play no role in reasoning about the plan until they are eventually acted upon, the penalty for postponing some decisions can be quite high. We call this style of decision postponement passive postponement, and present experimental results that quantify the efficiency penalty it incurs. We also suggest an alternate approach, active postponement, that allows postponed decisions to impose constraints on the generation of a plan. This constraint-based approach to decision postponement has been implemented in the Descartes planning system. In Descartes, every planning decision is represented by a variable, with constraints on each variable representing criteria that must be satisfied by the corresponding decision. These constraints are managed by a general-purpose constraint engine, so that even postponed decisions play a role in reasoning about the plan. 1
Citations
|
644
|
Foundations of Constraint Satisfaction
– Tsang
- 1993
|
|
605
|
Planning for conjunctive goals
– Chapman
- 1987
|
|
404
|
UCPOP: A sound, complete, partial order planner for ADL
– Penberthy, Weld
- 1992
|
|
390
|
Systematic nonlinear planning
– McAllester, Rosenblitt
- 1991
|
|
360
|
Generating project networks
– Tate
- 1977
|
|
319
|
O-plan: the open planning architecture
– Currie, Tate
- 1991
|
|
152
|
Introducing the tileworld: Experimentally evaluating agent architectures
– Pollack, Ringuette
- 1990
|
|
106
|
Planning using a temporal world model
– Allen, Koomen
- 1983
|
|
93
|
Temporal Planning with Continuous Change
– Penberthy, Weld
- 1994
|
|
87
|
Planning with constraints (MOLGEN: Part 1
– Stefik
- 1981
|
|
49
|
Multi-Contributor Causal Structures for Planning: A Formalization and Evaluation
– Kambhampati
- 1992
|
|
47
|
Commitment Strategies in Planning: A Comparative Analysis
– Minton, Bresina, et al.
- 1991
|
|
44
|
Least-Cost Flaw Repair: A Plan Refinement Strategy for Partial-Order Planning
– Joslin, Pollack
- 1994
|
|
43
|
Threat-removal strategies for partial-order planning
– Peot, Smith
- 1993
|
|
21
|
Reasoning with Constraints within O-Plan2
– Tate, Drabble, et al.
- 1994
|
|
13
|
Planning as Refinement Search: A unified framework for comparative analysis of Search Space Size and Performance
– Kambhampati
- 1993
|
|
13
|
Action-based planning
– Lansky
- 1994
|
|
10
|
Experimental Investigation of An Agent Commitment Strategy
– Pollack, Joslin, et al.
- 1994
|
|
6
|
Constraint hierarchies. Lisp and symbolic computation
– Borning, Freeman-Benson, et al.
- 1992
|
|
4
|
The DIPART project: A status report
– Pollack, Znati, et al.
- 1994
|
|
1
|
Plan generation as dynamic constraint satisfaction. Forthcoming PhD dissertation from the
– Joslin
- 1995
|
|
1
|
Accelerating partial order planners by emphasizing deductive choices
– Schubert, Gerevini
- 1995
|
|
1
|
A least commitment approach to avoiding protection violations in nonlinear planning
– Bell
- 1988
|
|
1
|
Descartes: Dual-representation planning with temporal world models and constraints. Forthcoming PhD dissertation from the
– Joslin
- 1995
|
