ABTWEAK: abstracting a nonlinear, least commitment planner

Authors:
Qiang Yang;Josh D. Tenenberg
Affiliations:
Computer Science Department, University of Waterloo, Waterloo, Ontario, Canada;Computer Science Department, University of Rochester, Rochester, New York
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Year:
1990

Citing 8
Cited 4

Domain-independent planning: representation and plan generation

Artificial Intelligence
Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
Planning as search: a quantitative approach

Artificial Intelligence
Principles of artificial intelligence

Principles of artificial intelligence
Abstraction in planning

Abstraction in planning
Planning for Conjunctive Goals

Planning for Conjunctive Goals
Improving the efficiency of planning

Improving the efficiency of planning
Generating project networks

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2

Granular state space search

Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
The complexity of action redundancy

AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
An approach to safe continuous planning

PRIMA'04 Proceedings of the 7th Pacific Rim international conference on Intelligent Agents and Multi-Agent Systems
Socially computed scripts to support social problem solving skills

Proceedings of the SIGCHI Conference on Human Factors in Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the system ABTWEAK, which extends the precondition-elimination abstraction of AB-STRIPS to hierarchical planners using the nonlinear plan representation as defined in TWEAK. We show that ABTWEAK satisfies the monotonic property, whereby the existence of a lowest level solution II implies the existence of a highest level solution that is structurally similar to II. This property enables one to prune a considerable amount of the search space without loss of completeness.