Shakey: From Conception to History

  title={Shakey: From Conception to History},
  author={Benjamin Kuipers and Edward A. Feigenbaum and Peter E. Hart and Nils J. Nilsson},
  journal={AI Mag.},
hakey the Robot, conceived fifty years ago, was a seminal contribution to AI. Shakey perceived its world, planned how to achieve a goal, and acted to carry out that plan. This was revolutionary. At the Twenty-Ninth AAAI Conference on Artificial Intelligence, attendees gathered to celebrate Shakey, and to gain insights into how the AI revolution moves ahead. The celebration included a panel, chaired by Benjamin Kuipers and featuring AI pioneers Ed Feigenbaum, Peter Hart, and Nils Nilsson. This… 
Neurorobotics—A Thriving Community and a Promising Pathway Toward Intelligent Cognitive Robots
  • J. Krichmar
  • Computer Science, Medicine
    Front. Neurorobot.
  • 2018
My perspective on this field is provided, some of the landmark events are pointed out, and the future potential of Neurorobots is discussed.
Rearrangement: A Challenge for Embodied AI
A framework for research and evaluation in Embodied AI is described, based on a canonical task: Rearrangement, that can focus the development of new techniques and serve as a source of trained models that can be transferred to other settings.
DeepSym: Deep Symbol Generation and Rule Learning from Unsupervised Continuous Robot Interaction for Planning
A novel and general method that finds action-grounded, discrete object and effect categories and builds probabilistic rules over them that can be used in complex action planning and is verified in a physics-based 3d simulation environment.
What Is Robotics? Why Do We Need It and How Can We Get It?
The new discipline needs a departmental home in the universities which it can justify both intellectually and by its capacity to attract new diverse populations inspired by the age old human fascination with robots.
High-level representations through unconstrained sensorimotor learning
This paper investigates whether a deep reinforcement learning system that learns a dynamic task would facilitate the formation of high-level neural representations that might be considered as precursors of symbolic representation, which could be exploited by higher level neural circuits for better control and planning.
Robot and its living space: A roadmap for robot development based on the view of living space
This paper focuses on setting a theoretical framework of the robot’s living space to further understand the human-robot relationship and analyzes and summarizes the relative technologies which support robots living well in each space.
Path Planning for Multi-Object Push Problems in Continuous Domain
A new method for calculating a path for vehicles tasked with pushing multiple objects to multiple goal locations, which works in a continuous space whilst handling multiple objects in a push-only scenario and doesn’t use computationally heavy methods to find a potential path planning solution.
Formation of a Research Discipline Artificial Intelligence and Intellectics at the Technical University of Munich
A brief history of the Munich group for Artificial Intelligence/Intellectics, a research group that asserted itself over almost four decades and influenced and advanced the field, is provided.
Collision Free Navigation of a Multi-Robot Team for Intruder Interception
It is proved that each individual team member is able to traverse safely in the region, which is cluttered by many obstacles with any shapes to trap the target while using the sensors in some indefinite switching points and not continuously, which leads to saving energy consumption and increasing the battery life of the robots consequently.
A reference framework and overall planning of industrial artificial intelligence (I-AI) for new application scenarios
The research results of this paper have achieved good results in the related industrial field and can provide some reference for other industrial enterprises to plan, design, implement, and apply artificial intelligence.


Learning and Executing Generalized Robot Plans
Some major new additions to the STRIPS robot problem-solving system are described, including a process for generalizing a plan produced by STriPS so that problem-specific constants appearing in the plan are replaced by problem-independent parameters.
The formalism of this paper represents an advance over McCarthy (1963) and Green (1969) in that it permits proof of the correctness of strategies that contain loops and strategies that involve the acquisition of knowledge; and it is also somewhat more concise.
A deliberative architecture for AUV control
This paper presents an agent architecture developed to overcome this limitation through on-board planning using Constraint- based Reasoning and is integrated and tested in simulation and at sea.
Teleo-Reactive Programs for Agent Control
  • N. Nilsson
  • Computer Science
    J. Artif. Intell. Res.
  • 1994
Teleo-reactive (T-R) programs whose execution entails the construction of circuitry for the continuous computation of the parameters and conditions on which agent action is based support parameter binding and recursion.
O-Plan: The open Planning Architecture
The search control heuristics employed within the O-Plan planner involve the use of condition typing, time and resource constraints and domain constraints to allow knowledge about an application domain to be used to prune the search for a solution.
Spacecraft Autonomy Flight Experience: The DS1 Remote Agent Experiment
In May 1999 state-of-the-art autonomy technology was allowed to assume command and control of the Deep Space One spacecraft during the Remote Agent Experiment. This experiment demonstrated
From the remotest antiquity the phenomena which are displayed by living beings have been regarded as the emanations of a superior and immaterial principle acting on inert matter. Such is the opinion
Scene Analysis Using Regions
Abstract One of the vision projects of the Stanford Research Institute Artificial Intelligence Group is described. The method employed uses regions as basic data and progresses by successive
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
We describe a new problem solver called STRIPS that attempts to find a sequence of operators in a space of world models to transform a given initial world model into a model in which a given goal
A* Parsing: Fast Exact Viterbi Parse Selection
This work presents an extension of the classic A* search procedure to tabular PCFG parsing, which is simpler to implement than an upward-propagating best-first parser, is correct for a wide range of parser control strategies and maintains worst-case cubic time.