Richard E. Fikes, Peter E. Hart, & Nils J. Nilsson
For the past several years research on robot problem-solving methods has centered on what may one day be called "simple" plans: linear sequences of actions to be performed by single robots to achieve single goals in static environments.
There is a growing national need to increase the real productivity of our society, wherein "productivity" is defined to include such major factors as the quality of life of workers and the quality of products, consistent with the desires and expectations of the general public.
Existing robot projects in the field of artificial intelligence have concentrated on tasks wherein the robot must excite an action in order to change the current state of its environment.
Calculations involving points and lines in Euclidean spaces are often subject to annoying anomalies when the trigonometric functions are invoked. This paper illustrates a method by which use of these functions may often be avoided.
The QA4 programming language is designed for the writing of theorem-provers, robot planners, and problem solvers. This note presents an informal introduction to the unusual programming concepts used in the construction of such problem-solving programs.
An intelligent robot, operating in an external environment that cannot be fully modeled in the robot's software, must be able to monitor the success of its execution of a previously generated plan.
This paper describes a language for constructing problem-solving programs. The language can manipulate several data structures, including ordered and unordered sets.
When heuristic problem-solving programs are faced with large data bases that contain numbers of facts far in excess of those needed to solve any particular problem, their performance rapidly deteriorates.
A paradigm enabling heuristic problem solving programs to exploit an analogy between a current unsolved problem and a similar but previously solved problem to simplify its search for a solution is outlined. It is developed in detail for a first-order resolution logic theorem prover.
This technical note describes the nature and structure of the computer program ISUPPOSEW and some of its results. ISUPPOSEW is designed t o enable a robot to make conjectures, on the basis of its visual information, about elements of its environment that it cannot see.
