Scope and Abstraction: Two Criteria for Localized Planning

ion: Two Criteria for Localized Planning Amy L. Lansky Lise C. Getoor Recom Technologies/NASA Ames Research Center Artificial Intelligence Research Branch MS 269-2, Moffett Field, CA 94035-1000 LANSKY@PTOLEMY.ARC.NASA.GOV GETOOR@PTOLEMY.ARC.NASA.GOV Abstract Localization is a general-purpose representational technique for partitioning a problem into subproblems. A localized problem-solver searches several smaller search spaces, one for each subproblem. Unlike most methods of partitioning, however, localization allows for subproblems that overlap -- i.e. multiple search spaces may be involved in constructing shared pieces of the overall plan. In this paper we focus on two criteria for forming localizations: scope and abstraction. We describe a method for automatically generating such localizations and provide empirical results that contrast their use in an office-building construction domain. 1 Introduction Over the years, many researchers have focused on the use of abstraction t...