The University of Edinburgh -
Division of Informatics
Forrest Hill & 80 South Bridge

Research Paper #808

Title:Computing Abstraction Hierarchies by Numerical Simulation
Authors:Bundy,A; Giunchiglia,F; Sebastiani,R; Walsh,T
Date:May 1996
Presented:Accepted for publication in AAAI-9
Abstract:We present a novel method for building ABSTRIPS-style abstraction hierarchies in planning. The aim of this method is to minimize the amount of backtracking betwen abstraction levels. Previous approaches have determined the criticality of operator preconditions by reasoning about plans directly. Here, we adopt a simpler and faster approach where we use numerical simulation of the planning process. We demonstrate the theoretical advantages of our approach by identifying some simple properties lacking in previous approaches but possessed by our method. We demonstrate the empirical advantages of our approach by a set of four benchmark experiments using the ABTWEAK system. We compare the quality of the abstraction hierarchies generated with those built by the ALPINE and HIGHPOINT algorithms.

[Search These Pages] [DAI Home Page] [Comment]