WHAT DEFAULTS CAN DO THAT HIERARCHIES CAN'T

Article type: Research Article

Authors: Ginsberg, Matthew L. | Holbrook, Hugh W.

Affiliations: CIRL, Department of Computer and Information Science, Department of Computer Science, University of Oregon, Eugene, OR 97403 | Department of Computer Science, Stanford University, Stanford, CA 94305

Abstract: 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.

DOI: 10.3233/FI-1994-21129

Journal: Fundamenta Informaticae, vol. 21, no. 1-2, pp. 149-159, 1994