Hewitt, C.


Description and theoretical analysis (using schemata) of PLANNER, a language for proving theorems and manipulating models in a robot

Classics

Abstract: PLANNER is a formalism for proving theorems and manipulating models in a robot. The formalism is built out of a number of problem-solving primitives together with a hierarchical multiprocess backtrack control structure. Under BACKTRACK control structure, the hierarchy of activations of functions previously executed is maintained so that it is possible to revert to any previous state. In addition PLANNER uses multiprocessing so that there can be multiple loci of control over the problem-solving.