Plan-Refinement Strategies and Search-Space Size

During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner's efficiency depends on how it chooses which refinement to do next. Recent studies have shown that several versions of the popular “least commitment” plan refinement strategy are often outperformed by a fewest alternatives first (FAF) strategy that chooses to refine the plan element that has the smallest number of alternative refinement options.

[1]  Manuela M. Veloso,et al.  FLECS: Planning with a Flexible Commitment Strategy , 1995, J. Artif. Intell. Res..

[2]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[3]  Earl David Sacerdoti,et al.  A Structure for Plans and Behavior , 1977 .

[4]  William F. Clocksin,et al.  Programming in Prolog , 1981, Springer Berlin Heidelberg.

[5]  Subbarao Kambhampati,et al.  Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..

[6]  Lenhart K. Schubert,et al.  Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning , 1996, J. Artif. Intell. Res..

[7]  Paul Walton Purdom,et al.  An Analysis of Backtracking with Search Rearrangement , 1983, SIAM J. Comput..

[8]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[9]  Anthony Barrett,et al.  Partial-Order Planning: Evaluating Possible Efficiency Gains , 1994, Artificial Intelligence.

[10]  James A. Hendler,et al.  Commitment Strategies in Hierarchical Task Network Planning , 1996, AAAI/IAAI, Vol. 1.

[11]  Martha E. Pollack,et al.  Is "Early Commitment" in Plan Generation Ever a Good Idea? , 1996, AAAI/IAAI, Vol. 2.

[12]  Dana S. Nau,et al.  On the Complexity of Blocks-World Planning , 1992, Artif. Intell..

[13]  George C. Stockman,et al.  A Minimax Algorithm Better than Alpha-Beta? , 1979, Artif. Intell..

[14]  Paul Walton Purdom,et al.  Search Rearrangement Backtracking and Polynomial Average Time , 1983, Artif. Intell..

[15]  Martha E. Pollack,et al.  Least-Cost Flaw Repair: A Plan Refinement Strategy for Partial-Order Planning , 1994, AAAI.

[16]  Mark Stefik,et al.  Planning with Constraints (MOLGEN: Part 1) , 1981, Artif. Intell..

[17]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

[18]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.