Scope and abstraction: two criteria for localized planning

Authors:
Amy L. Laneky;Lise C. Getoor
Affiliations:
Recom Technologies, NASA Ames Research Center, Moffett Field, CA;Recom Technologies, NASA Ames Research Center, Moffett Field, CA
Venue:
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Year:
1995

Citing 2
Cited 10

Planning as search: a quantitative approach

Artificial Intelligence
Investigating the utility of artificial intelligence techniques for automatic generation of construction project plans

Investigating the utility of artificial intelligence techniques for automatic generation of construction project plans

Controlling communication in distributed planning using irrelevance reasoning

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Decomposition of planning problems

AI Communications
Factored planning: how, when, and when not

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
The role of macros in tractable planning over causal graphs

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Factored planning using decomposition trees

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Factored planning

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Coordination by design and the price of autonomy

Autonomous Agents and Multi-Agent Systems
Synthesizing plans for multiple domains

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
On the complexity of planning for agent teams and its implications for single agent planning

Artificial Intelligence
Group planning with time constraints

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

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.