What Defaults can do that Hierarchies Can't

This paper extends existing work on the use of default information to describe planning hierarchies in two ways. First, we present a completeness result showing that all hierarchical planners can be described using defaults. Second, we show that if the planning hierarchy is situation-dependent, the default description is likely to have substantial computational advantages over a more conventional approach.

[1]  David E. Smith,et al.  A critical look at Koblock's hierarchy mechanism , 1992 .

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

[3]  Matthew L. Ginsberg,et al.  Is There any Need for Domain-Dependent Control Information? , 1991, AAAI.

[4]  Andrew B. Baker,et al.  Nonmonotonic Reasoning in the Framework of Situation Calculus , 1991, Artif. Intell..

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

[6]  David E. Smith,et al.  Reasoning About Action I: A Possible Worlds Approach , 1987, Artif. Intell..

[7]  David E. Wilkins,et al.  Domain-Independent Planning: Representation and Plan Generation , 1984, Artif. Intell..

[8]  Craig A. Knoblock.  Learning Abstraction Hierarchies for Problem Solving , 1990, AAAI.

[9]  Vladimir Lifschitz,et al.  ON THE SEMANTICS OF STRIPS , 1987 .

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

[11]  Matthew L. Ginsberg.  The Computational Value of Nonmonotonic Reasoning , 1991, KR.

[12]  Paul Morris,et al.  Admissible Criteria for Loop Control in Planning , 1990, AAAI.

[13]  Matthew L. Ginsberg,et al.  Computational Considerations in Reasoning about Action , 1991, KR.

[14]  Richard E. Korf,et al.  Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..

[15]  J. Finger,et al.  Exploiting constraints in design synthesis , 1987 .