Autonomous Robots and the SP Theory of Intelligence

This paper is about how the SP theory of intelligence and its realization in the SP machine (both outlined in this paper) may help in the design of the brains of autonomous robots, meaning robots that do not depend on external intelligence or power supplies, are mobile, and have human-like versatility and adaptability in intelligence. This paper addresses three main problems: 1) how to increase the computational and energy efficiency of computers and to reduce their size and weight; 2) how to achieve human-like versatility in intelligence; and 3) likewise for human-like adaptability in intelligence. Regarding the first problem, the SP system has the potential for substantial gains in computational efficiency, with corresponding cuts in energy consumption and the bulkiness of computers: 1) by reducing the size of data to be processed; 2) by exploiting statistical information that the system gathers as an integral part of how it works; and 3) via a new version of Donald Hebb's concept of a cell assembly. Toward human-like versatility in intelligence, the SP system has strengths in unsupervised learning, natural language processing, pattern recognition, information retrieval, several kinds of reasoning, planning, problem solving, and more, with seamless integration among structures and functions. The SP system's strengths in unsupervised learning and other aspects of intelligence may help in achieving human-like adaptability in intelligence via: 1) one-trial learning; 2) learning of natural language; 3) learning to see; 4) building 3-D models of objects and of a robot's surroundings; 5) learning regularities in the workings of a robot and in the robot's environment; 6) exploration and play; 7) learning major skills; and 8) learning via demonstration. Also discussed are how the SP system may process parallel streams of information, generalization of knowledge, correction of over-generalizations, learning from dirty data, how to cut the cost of learning, and reinforcements and motivations.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.