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 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 control over the problem-solving.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1972
Accession Number
AD0744620

Entities

People

  • Carl Hewitt

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • C4I
  • Cyber
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Automata
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Failure Mode And Effect Analysis
  • Formal Languages
  • Information Processing
  • Language
  • Mathematics
  • Parallel Computing
  • Pattern Recognition
  • Recursive Functions
  • Three Dimensional
  • Two Dimensional

Readers

  • Parallel and Distributed Computing.
  • Robotics and Automation.
  • Systems Analysis and Design

Technology Areas

  • AI & ML
  • AI & ML - Autonomous Systems
  • AI & ML - Machine Learning Algorithms
  • Autonomy
  • Autonomy - Autonomous System Control