Creating better abstract operators

Authors:
Jonathan Teutenberg;Mike Barley
Affiliations:
Department of Computer Science, The University of Auckland, New Zealand;Department of Computer Science, The University of Auckland, New Zealand
Venue:
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Year:
2005

Citing 7
Cited 0

Automatically generating abstractions for problem solving

Automatically generating abstractions for problem solving
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Understanding Natural Language

Understanding Natural Language
Passive and active decision postponement in plan generation

Passive and active decision postponement in plan generation
Automatic representation changes in problem solving

Automatic representation changes in problem solving
SHOP2: an HTN planning system

Journal of Artificial Intelligence Research
Generating project networks

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using abstract operators for least commitment in planning has been shown to potentially reduce the search space by an exponential factor. However a naive application of these operators can result in an unbounded growth in search space for the worst case. In this paper we investigate another important aspect of abstract operators – that of their construction. Similar to their application, naive construction of an abstract operator may leave you with little search space reduction even in the best case, and significant penalties in the worst. We explain what it means to be a good abstract operator and describe a method of creating good abstract operators.