Planning in a hierarchy of abstraction spaces
Earl D. Sacerdott · 1973
A problem domain can be represented as a hierarchy of abstraction spaces in which successively finer levels of detail are introduced. The problem sotver ABSTRIPS, a modification of STRIPS, can define an abstraction space hierarchy from the STRIPS representatien of a problem domain, and it can utilize the hierarchy in solving problems. Examples of the system's 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.