Scope and abstraction: two criteria for localized planning
Amy L. Laneky, Lise Getoor
Abstract
Amy L. Laneky, Lise Getoor
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- 1 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
OpenAlex reports 29 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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- 1 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
Key concepts: Scope (computer science), Abstraction, Computer science, Plan (archaeology), Focus (optics), Domain (mathematical analysis), Solver, Theoretical computer science