Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot

摘要: Abstract : PLANNER is a formalism for proving theorems and manipulating models in robot. The built out of number problem-solving primitives together with hierarchical multiprocess backtrack control structure. Statements can be asserted perhaps later withdrawn as the state world changes. Under BACKTRACK structure, hierarchy activations functions previously executed maintained so that it possible to revert any previous state. Thus programs easily manipulate elaborate hypothetical tentative states. In addition uses multiprocessing there multiple loci over problem-solving.