Using Regression-Match Graphs to Control Search in Planning

[1]  S. CorinR.AndersonDavidE.SmithDaniel,et al.  Conditional E ects in Graphplan , 1998 .

[2]  James A. Hendler,et al.  Plan-Refinement Strategies and Search-Space Size , 1997, ECP.

[3]  Bernhard Nebel,et al.  Extending Planning Graphs to an ADL Subset , 1997, ECP.

[4]  Craig A. Knoblock,et al.  Planning by Rewriting: E ciently Generating High-Quality Plans , 1999 .

[5]  Bart Selman,et al.  Encoding Plans in Propositional Logic , 1996, KR.

[6]  Subbarao Kambhampati,et al.  On the Role of Disjunctive Representations and Constraint Propagation in Refinement Planning , 1996, KR.

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

[8]  Drew McDermott,et al.  A Heuristic Estimator for Means-Ends Analysis in Planning , 1996, AIPS.

[9]  Martha E. Pollack,et al.  Passive and active decision postponement in plan generation , 1996 .

[10]  S. Kambhampati,et al.  Universal classical planner: an algorithm for unifying state-space and plan-space planning , 1996 .

[11]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[12]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[13]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

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

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

[16]  Daniel S. Weld.  An Introduction to Least Commitment Planning , 1994, AI Mag..

[17]  Manuela M. Veloso,et al.  Linkability: Examining Causal Link Commitments in Partial-order Planning , 1994, AIPS.

[18]  Daniel S. Weld,et al.  Partial-Order Planning: Evaluating Possible Efficiency Gains , 1994, Artif. Intell..

[19]  Eugene Fink,et al.  Prodigy Planning Algorithm , 1994 .

[20]  B. Richards,et al.  Planning with constraints , 1994 .

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

[22]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[23]  Allen Newell,et al.  GPS, a program that simulates human thought , 1995 .

[24]  David E. Wilkins,et al.  Practical planning - extending the classical AI planning paradigm , 1989, Morgan Kaufmann series in representation and reasoning.

[25]  E. Pednault.  Toward a mathematical theory of plan synthesis , 1987 .

[26]  Gerald Jay Sussman,et al.  A Computer Model of Skill Acquisition , 1975 .

[27]  Richard Fikes,et al.  Learning and Executing Generalized Robot Plans , 1993, Artif. Intell..

[28]  George W. Ernst,et al.  GPS : a case study in generality and problem solving , 1971 .

[29]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.