Advanced Search
DSpace@MIT

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

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Hewitt, Carl en_US
dc.date.accessioned 2004-10-20T20:06:44Z
dc.date.available 2004-10-20T20:06:44Z
dc.date.issued 1972-04-01 en_US
dc.identifier.other AITR-258 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/6916
dc.description.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. Statements can be asserted and perhaps later withdrawn as the state of the world changes. 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. Thus programs can easily manipulate elaborate hypothetical tentative states. In addition PLANNER uses multiprocessing so that there can be multiple loci of changes in state. Goals can be established and dismissed when they are satisfied. The deductive system of PLANNER is subordinate to the hierarchical control structure in order to maintain the desired degree of control. The use of a general-purpose matching language as the basis of the deductive system increases the flexibility of the system. Instead of explicitly naming procedures in calls, procedures can be invoked implicitly by patterns of what the procedure is supposed to accomplish. The language is being applied to solve problems faced by a robot, to write special purpose routines from goal oriented language, to express and prove properties of procedures, to abstract procedures from protocols of their actions, and as a semantic base for English. en_US
dc.format.extent 90382428 bytes
dc.format.extent 65971255 bytes
dc.format.mimetype application/postscript
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.relation.ispartofseries AITR-258 en_US
dc.title Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot en_US


Files in this item

Name Size Format Description
AITR-258.ps 86.19Mb Postscript
AITR-258.pdf 62.91Mb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage