1995•Unpublished venueRequires access

Scope and abstraction: two criteria for localized planning

Amy L. Laneky, Lise Getoor

Open publisher page 29 citations

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

About this research paper

What this paper is about

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

Why it matters

OpenAlex reports 29 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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

Key concepts: Scope (computer science), Abstraction, Computer science, Plan (archaeology), Focus (optics), Domain (mathematical analysis), Solver, Theoretical computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Scope and abstraction: two criteria for localized planning — Research Paper | ScholarLens