by David E. Smith, Mark A. Peot
Procs. of AIPS-96
http://www.rpal.rockwell.com/~peot/recursion.ps
Add To MetaCart
Abstract:
We present a strategy for suspending recursive open conditions during planning. We also show conditions under which plans with suspended open conditions can be pruned. To make this suspension and pruning strategy efficient, we use an operator graph to analyze potential recursion before the planning process begins. This approach covers a broader range of recursive problems than the approaches of Morris and Kambhampati, and is much more tractable than Kambhampati's approach. We give experimental results that indicate 1) significant improvement on recursive problems and 2) negligible overhead when applied to recursive and non-recursive problems alike.
Citations
|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1992
|
|
389
|
UCPOP: A sound, complete, partial order planner for ADL
– Penberthy, Weld
- 1992
|
|
378
|
Systematic nonlinear planning
– McAllester, Rosenblitt
- 1991
|
|
348
|
Learning and executing generalized robot plans
– Fikes, Hart, et al.
- 1972
|
|
342
|
Generating project networks
– Tate
- 1977
|
|
90
|
Partial Order Planning: Evaluating Possible Efficiency Gains
– Barrett, Weld
- 1994
|
|
88
|
Acquiring search-control knowledge via static analysis
– Etzioni
- 1993
|
|
43
|
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
|
|
17
|
Controlling recursive inference
– Smith, Genesereth, et al.
- 1986
|
|
7
|
Admissible pruning strategies based on plan minimality for planspace planning
– Kambhampati
- 1995
|
|
4
|
Admissible criteria for loop control in planning
– Feldman, Morris
- 1990
|
|
2
|
Postponing threats in partial order planning
– Smith, Peot
- 1993
|
|
1
|
A Note on the DMIN strategy
– Smith, Peot
- 1993
|
