Plan Abstraction Based on Operator Generalization
Abstract
We describe a planning system which automatically creates abstract operators while organizing a given set of primitive operators into a taxonomic hierarchy. At the same time, the system creates categories of abstract object types which allow abstract operators to apply to broad classes of functionally similar ob-jects. After the system has found a plan to achieve a particular goal, it replaces each primitive operator in the plan with one of its ancestors from the operator taxonomy. The resulting abstract plan is incorpo-operator, an abstract-macro. The next time the plan-ner is faced with a similar task, it can specialize the abstract-macro into a suitable plan by again using the operators with appropriate descendants. I.
Cite
Text
Anderson and Farley. "Plan Abstraction Based on Operator Generalization." AAAI Conference on Artificial Intelligence, 1988.Markdown
[Anderson and Farley. "Plan Abstraction Based on Operator Generalization." AAAI Conference on Artificial Intelligence, 1988.](https://mlanthology.org/aaai/1988/anderson1988aaai-plan/)BibTeX
@inproceedings{anderson1988aaai-plan,
title = {{Plan Abstraction Based on Operator Generalization}},
author = {Anderson, John S. and Farley, Arthur M.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1988},
pages = {100-104},
url = {https://mlanthology.org/aaai/1988/anderson1988aaai-plan/}
}