Planning in a Hierarchy of Abstraction Spaces
by Sacerdoti, Earl D.
Technical Note 78
Institution: AI Center, SRI International
Address: 333 Ravenswood Ave, Menlo Park, CA 94025
Note: Proceedings International Joint Conference on Artificial Intelligence (to appear August 1973). SRI Project 1530. The work reported herein was sponsored by the Advanced Research Projects Agency of the Department of Defense under Contract DAHC04-72-C-0008 with the U.S. Army Research Office.
A problem domain can be represented as a hierarchy of abstraction spaces in which successively finer levels of detail are introduced. The problem solver ABSTRIPS, a modification of STRIPS, can define an abstraction of space hierarchy from the STRIPS representation of a problem domain, and it can utilize the hierarchy in solving problems. Examples of the systems performance are presented that demonstrate the significant increases in problem-solving power that this approach provides. Then some further implications of the hierarchical planning approach are explored.
|Sacerdoti, Earl D.||Alumnus|