Fast Planning Through Planning Graph Analysis

[1]  Raghavan Srinivasan,et al.  Comparison of Methods for Improving Search Efficiency in a Partial-Order Planner , 1995, IJCAI.

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

[3]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[4]  Manuela M. Veloso,et al.  The Need for Different Domain-independent Heuristics , 1994, AIPS.

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

[6]  Craig A. Knoblock.  Generating Parallel Execution Plans with a Partial-order Planner , 1994, AIPS.

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

[8]  Daniel S. Weld.  Introduction to Partial Order Planning , 1994 .

[9]  Oren Etzioni,et al.  A Structural Theory of Explanation-Based Learning , 1993, Artif. Intell..

[10]  Stuart J. Russell.  Efficient Memory-Bounded Search Methods , 1992, ECAI.

[11]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[13]  Manuela Veloso.  Nonlinear problem solving using intelligent casual-commitment , 1989 .

[14]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[15]  Juris Hartmanis,et al.  Proceedings of the eighteenth annual ACM symposium on Theory of computing , 1986, STOC 1986.

[16]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

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

[18]  H. Redkey,et al.  A new approach. , 1967, Rehabilitation record.