DOCSLIB.ORG

The Early Robots Classes of Robots

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Early Robots Classes of Robots The Early Robots Classes of Robots Slave manipulator teleoperated by a human master Limited-Sequence manipulator Teach-replay robot Computer-controlled robot Intelligent robot Research Issues Hardware (out of scope) Motor Control Mobility Surfaces – smooth or rough, indoor or outdoor, stairs/holes, obstacles Wheels, legs, tracks Manipulation gripper design, force-feedback, grasp pose Sensing contact/non-contact sensors, laser range-finders, visible light cameras, structured light, sonar Planning representation and mapping of 3D world, navigation, path with workspace, task satisfaction, obstacle avoidance Control integration of motor control, , sensing, navigation, communication, execution monitoring, failure detection/correction Communication human interface, results, monitoring, task specification Outline Lecture 1; Bristol’s Tortoise (1948-1949) Johns Hopkins’ Ferdinand & Beast (1960) Stanford Cart (1970-1979) SRI’s Shakey (1966 – 1972) Max Planck Tubingen’s Braitenburg’s Vehicles (1984) U Munich’s VaMoRs (1986+) Lecture 2: Honda’s P3 (1986+) MIT’s Subsumption Robots (1986+) CMU’s Dante II (1994-1999) MIT’s Kismet (1998-2000) JPL’s CLARAty and Rocky 7 (2000) Walter’s tortoises (1948-9) • Grey Walter wanted to prove that rich connections between a small number of brain cells could give rise to very complex behaviors - essentially that the secret of how the brain worked lay in how it was wired up. • His first robots, which he used to call "Machina Speculatrix" and named Elmer and Elsie, were constructed between 1948 and 1949 and were often described as tortoises due to their shape and slow rate of movement - and because they 'taught us’ about the secrets of organisation and life. • The three-wheeled tortoise robots were capable of phototaxis, by which they could find their way to a recharging station when they ran low on battery power. Video (2:17) http://www.youtube.com/watch?v=lLULRlmXkKo Ref: http://en.wikipedia.org/wiki/William_Grey_Walter Principles Learned from Walter’s Tortoise • Parsimony: simple is better • Exploration or speculation: constant motion to avoid traps • Attraction (positive tropism): move towards positive stimuli • Aversion (negative tropism): move away from negative stimuli • Discernment: distinguish between productive and unproductive behavior Johns Hopkins Ferdinand & Beast Controlled by dozens of transistors, the Johns Hopkins University Applied Physics Lab's “Ferdinand” and "Beast" wandered white hallways, centering by sonar, avoiding obstacles, stairs, and open doorways, until its batteries ran low. Then it would seek black wall outlets with special photocell optics, and plug Ferdinand itself in by feel with its special recharging arm. After feeding, it would resume Beast patrolling. Reference: An Overview of Information Processing and Management at APL Ralph D. Semmel, JOHNS HOPKINS APL TECHNICAL DIGEST, VOLUME 24, NUMBER 1 (2003) Stanford Cart (1970-79) The "Stanford Cart" and SRI's "Shakey" were the first mobile robots controlled by computers (room-sized, radio linked). Both saw with TV cameras. The Cart followed smudgy white lines seen from a high vantage point in variable illumination quite reliably using adaptation and prediction methods Stanford cart (1977-79) First experiments with 3D environment mapping. The Stanford Cart crosses a chair-filled room without human assistance. The cart has a TV camera mounted on a rail which takes pictures from multiple angles and relays them to a computer. The computer analyzes the distance between the cart and the obstacles. • 0.5MHz processor with 1MB memory • 1m every 15 minutes Stanford Cart – Overall Control 1. Calibration: The cart is parked in a standard position in front of a wall of spots. A calibration program notes the disparity in position of the spots in the image seen by the camera with their position predicted from an idealized model of the situation. It calculates a distortion correction polynomial which relates these positions, and which is used in subsequent ranging calculations. 2. The obstacle avoiding program is started. It begins by asking for the cart's destination, relative to its current position and heading. After being told, say, 50 meters forward and 20 to the right, it begins. 3. It activates a mechanism which moves the TV camera, and digitizes about nine pictures as the camera slides (in precise steps) from one side to the other along a 50 cm track. 4. A subroutine called the interest operator is applied to the one of these pictures. It picks out 30 or so particularly distinctive regions (features) in this picture. Another routine called the correlator looks for these same regions in the other frames. A program called the camera solver determines the three dimensional position of the features with respect to the cart from their apparent movement image to image. 5. The navigator plans a path to the destination which avoids all the perceived features by a large safety margin. The program then sends steering and drive commands to the cart to move it about a meter along the planned path. The cart's response to such commands is not very precise. 6. After the step forward the camera is operated as before, and nine new images are acquired. The control program uses a version of the correlator to find as many of the features from the previous location as possible in the new pictures, and applies the camera solver. The program then deduces the cart's actual motion during the step from the apparent three dimensional shift of these features. The motion of the cart as a whole is larger and less constrained than the precise slide of the camera. The images between steps forward can vary greatly, and the correlator is usually unable to find many of the features it wants. The interest operator/correlator/ camera solver combination is used to find new features to replace lost ones. 7. The three dimensional location of any new features found is added to the program's model of the world. The navigator is invoked to generate a new path that avoids all known features, and the cart is commanded to take another step forward. 8. This continues until the cart arrives at its destination or until some disaster terminates the program. Problems? A method as simple as this is unlikely to handle every situation well. The most obvious problem is the apparently random choice of features tracked. If the interest operator happens to avoid choosing any points on a given obstruction, the program will never notice it, and might plan a path right through it. The interest operator was designed to minimize this danger. It chooses a relatively uniform scattering of points over the image, locally picking those with most contrast. Effectively it samples the picture at low resolution, indicating the most promising regions in each sample area. Objects lying in the path of the vehicle occupy ever larger areas of the camera image as the cart rolls forward. The interest operator is applied repeatedly, and the probability that it will choose a feature or two on the obstacle increases correspondingly. Typical obstructions are generally detected before its too late. Very small or very smooth objects are sometimes overlooked. Video and References Ref: Moravec, H. P., Obstacle avoidance and navigation in the real world by a seeing robot rover, PhD in Computer Science, Stanford U., 1980. Video (3:25): http://www.frc.ri.cmu.edu/users/hpm/talks/ Cart.1979/Cart.final.mov Shakey Shakey the Robot was the first general-purpose mobile robot to be able to reason about its own actions. While other robots would have to be instructed on each individual step of completing a larger task, Shakey could analyze the command and break it down into basic chunks by itself. Due to its nature, the project combined research in robotics, computer vision, and natural language processing. Because of this, it was the first project that melded logical reasoning and physical action. Shakey was developed at the Artificial Intelligence Center of Stanford Research Institute (now called SRI International) in 1966 through 1972 with Charles Rosen as project manager. Other major contributors included Nils Nilsson, Alfred Brain, Bertram Raphael, Richard Duda, Peter Hart, Richard Fikes, Richard Waldinger, Thomas Garvey, Jay Tenenbaum, and Michael Wilber. The robot's programming was primarily done in LISP. The STRIPS planner it used was conceived as the main planning component for the software it utilized. Shakey had a TV camera, a triangulating range finder, and bump sensors, and was connected to DEC PDP-10 and PDP-15 computers via radio and video links. Shakey Video Papers: see http://www.ai.sri.com/shakey/ Video: (24:02) http://video.nytimes.com/video/2010/06/16/ science/1247468057234/shakey.html Braitenberg’s Vehicles (1984) A Braitenberg vehicle is a concept conceived in a thought experiment by the Italian-Austrian cyberneticist Valentino Braitenberg to illustrate in an evolutive way the abilities of simple agents. The vehicles represent the simplest form of behavior based artificial intelligence or embodied cognition, i.e. intelligent behavior that emerges from sensorimotor interaction between the agent and its environment, without any need for an internal memory, representation of the environment, or inference. • Created wide range of vehicles • Vehicles used inhibitory and excitatory influences • Direct coupling of sensors to motors Examples The following examples are some of Braitenberg's simplest vehicles. A first agent has one light-detecting sensor that directly stimulates its single wheel, implementing the following rules: More light produces faster movement. Less light produces slower movement. Darkness produces standstill. This behavior can be interpreted as a creature that is afraid of the light and that moves fast to get away from it. Its goal is to find a dark spot to hide. A slightly more complex agent has two light detectors (left and right) each stimulating a wheel on the same side of the body. It obeys the following rule: More light right → right wheel turns faster → turns towards the left, away from the light.
Load more

Recommended publications
  • "Shakey the Robot" [Videorecording]
    http://oac.cdlib.org/findaid/ark:/13030/kt2s20358k No online items Guide to "Shakey the Robot" [videorecording] Daniel Hartwig Stanford University. Libraries.Department of Special Collections and University Archives Stanford, California November 2010 Copyright © 2015 The Board of Trustees of the Leland Stanford Junior University. All rights reserved. Note This encoded finding aid is compliant with Stanford EAD Best Practice Guidelines, Version 1.0. Guide to "Shakey the Robot" V0209 1 [videorecording] Overview Call Number: V0209 Creator: Stanford University Title: "Shakey the Robot" [videorecording] Dates: 1995 Physical Description: 0.125 Linear feet (1 videotape-VHS) Summary: Program of the Bay Area Computer History Perspectives held at SRI International on October 24, 1995, on a 1970 SRI project to create a robot (dubbed Shakey) that used rudimentary artificial intelligence to interact with its surroundings. Speakers were Nils Nilsson, Charles Rosen, Bertram Raphael, Bruce Donald, Richard Fikes, Peter Hart, and Stuart Russell. The video includes clips from the original "Shakey the Robot" movie. Language(s): The materials are in English. Repository: Department of Special Collections and University Archives Green Library 557 Escondido Mall Stanford, CA 94305-6064 Email: [email protected] Phone: (650) 725-1022 URL: http://library.stanford.edu/spc Information about Access This collection is open for research. Ownership & Copyright All requests to reproduce, publish, quote from, or otherwise use collection materials must be submitted in writing to the Head of Special Collections and University Archives, Stanford University Libraries, Stanford, California 94304-6064. Consent is given on behalf of Special Collections as the owner of the physical items and is not intended to include or imply permission from the copyright owner.
    [Show full text]
  • The People Who Invented the Internet Source: Wikipedia's History of the Internet
    The People Who Invented the Internet Source: Wikipedia's History of the Internet PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sat, 22 Sep 2012 02:49:54 UTC Contents Articles History of the Internet 1 Barry Appelman 26 Paul Baran 28 Vint Cerf 33 Danny Cohen (engineer) 41 David D. Clark 44 Steve Crocker 45 Donald Davies 47 Douglas Engelbart 49 Charles M. Herzfeld 56 Internet Engineering Task Force 58 Bob Kahn 61 Peter T. Kirstein 65 Leonard Kleinrock 66 John Klensin 70 J. C. R. Licklider 71 Jon Postel 77 Louis Pouzin 80 Lawrence Roberts (scientist) 81 John Romkey 84 Ivan Sutherland 85 Robert Taylor (computer scientist) 89 Ray Tomlinson 92 Oleg Vishnepolsky 94 Phil Zimmermann 96 References Article Sources and Contributors 99 Image Sources, Licenses and Contributors 102 Article Licenses License 103 History of the Internet 1 History of the Internet The history of the Internet began with the development of electronic computers in the 1950s. This began with point-to-point communication between mainframe computers and terminals, expanded to point-to-point connections between computers and then early research into packet switching. Packet switched networks such as ARPANET, Mark I at NPL in the UK, CYCLADES, Merit Network, Tymnet, and Telenet, were developed in the late 1960s and early 1970s using a variety of protocols. The ARPANET in particular led to the development of protocols for internetworking, where multiple separate networks could be joined together into a network of networks. In 1982 the Internet Protocol Suite (TCP/IP) was standardized and the concept of a world-wide network of fully interconnected TCP/IP networks called the Internet was introduced.
    [Show full text]
  • UC Berkeley Previously Published Works
    UC Berkeley UC Berkeley Previously Published Works Title Building the Second Mind, 1961-1980: From the Ascendancy of ARPA-IPTO to the Advent of Commercial Expert Systems Permalink https://escholarship.org/uc/item/7ck3q4f0 ISBN 978-0-989453-4-6 Author Skinner, Rebecca Elizabeth Publication Date 2013-12-31 eScholarship.org Powered by the California Digital Library University of California Building the Second Mind, 1961-1980: From the Ascendancy of ARPA to the Advent of Commercial Expert Systems copyright 2013 Rebecca E. Skinner ISBN 978 09894543-4-6 Forward Part I. Introduction Preface Chapter 1. Introduction: The Status Quo of AI in 1961 Part II. Twin Bolts of Lightning Chapter 2. The Integrated Circuit Chapter 3. The Advanced Research Projects Agency and the Foundation of the IPTO Chapter 4. Hardware, Systems and Applications in the 1960s Part II. The Belle Epoque of the 1960s Chapter 5. MIT: Work in AI in the Early and Mid-1960s Chapter 6. CMU: From the General Problem Solver to the Physical Symbol System and Production Systems Chapter 7. Stanford University and SRI Part III. The Challenges of 1970 Chapter 8. The Mansfield Amendment, “The Heilmeier Era”, and the Crisis in Research Funding Chapter 9. The AI Culture Wars: the War Inside AI and Academia Chapter 10. The AI Culture Wars: Popular Culture Part IV. Big Ideas and Hardware Improvements in the 1970s invert these and put the hardware chapter first Chapter 11. AI at MIT in the 1970s: The Semantic Fallout of NLR and Vision Chapter 12. Hardware, Software, and Applications in the 1970s Chapter 13.
    [Show full text]
  • Strategic Latency: Red, White, and Blue Managing the National and International Security Consequences of Disruptive Technologies Zachary S
    Strategic Latency: Red, White, and Blue Managing the National and International Security Consequences of Disruptive Technologies Zachary S. Davis and Michael Nacht, editors Center for Global Security Research Lawrence Livermore National Laboratory February 2018 Disclaimer: This document was prepared as an account of work sponsored by an agency of the United States government. Neither the United States government nor Lawrence Livermore National Security, LLC, nor any of their employees makes any warranty, expressed or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States government or Lawrence Livermore National Security, LLC. The views and opinions of authors expressed herein do not necessarily state or reflect those of the United States government or Lawrence Livermore National Security, LLC, and shall not be used for advertising or product endorsement purposes. LLNL-BOOK-746803 Strategic Latency: Red, White, and Blue: Managing the National and International Security Consequences of Disruptive Technologies Zachary S. Davis and Michael Nacht, editors Center for Global Security Research Lawrence Livermore National Laboratory February
    [Show full text]
  • DARPA Grand Challenge - Wikipedia 1 of 11
    DARPA Grand Challenge - Wikipedia 1 of 11 DARPA Grand Challenge The DARPA Grand Challenge is a prize competition for American autonomous vehicles, funded by the Defense Advanced Research Projects Agency, the most prominent research organization of the United States Department of Defense. Congress has authorized DARPA to award cash prizes to further DARPA's mission to sponsor revolutionary, high- payoff research that bridges the gap between fundamental discoveries and military use. The initial DARPA Grand Challenge was created to spur the development of technologies needed to create the first fully autonomous ground vehicles capable of completing a substantial off-road course within a limited time. The third event, the DARPA Urban Challenge extended the initial Challenge to The site of the DARPA Grand Challenge on race autonomous operation in a mock urban environment. day, fronted by the Team Case vehicle, DEXTER The most recent Challenge, the 2012 DARPA Robotics Challenge, focused on autonomous emergency- maintenance robots. The first competition of the DARPA Grand Challenge was held on March 13, 2004 in the Mojave Desert region of the United States, along a 150-mile (240 km) route that follows along the path of Interstate 15 from just before Barstow, California to just past the California–Nevada border in Primm. None of the robot vehicles finished the route. Carnegie Mellon University's Red Team and car Sandstorm (a converted Humvee) traveled the farthest distance, completing 11.78 km (7.32 mi) of the course before getting hung up on a rock after making a switchback turn. No winner was declared, and the cash prize was not given.
    [Show full text]
  • CLIENT PRIVATE Proposal for Research SRI No. ISC 77~20 Teit PROCESSING SYSTEM Mr George Stehle Second Vice President the Chase Manhattan Bank,N.A
    @ STANFORD RESEARCH INSTITUTE MENLO PARK, CALIFORNIA 94025 (415) 326-6200 February 15, 1977 CLIENT PRIVATE Proposal for Research SRI No. ISC 77~20 TEiT PROCESSING SYSTEM Mr George Stehle Second Vice President The Chase Manhattan Bank,N.A. 1 New York Plaza New York, NY 10015 Dear Mr. Stehle: Stanford Research Institute (SRI) hereby submits the enclosed proposal, SRI No. ISC 77-20, in response to yoUr letter' of January 1~ and its enclosed RFP for the Text Processing (TXTP) project. As you suggested in your letter, SRI is bidding primarily on software and its support, rather than on hardware and its maintenance. However, all the hardware required for satisfactory use of the proposed system is fully specified in our proposal and is readily available for purchase or lease, including installation and maintenance, from standard sources. I am confident you will find that our proposal is fully responsive to the technical requirements of your RFP. The proposed system meets or exceeds all your basic requirements, and in fact contains many features that make it widely useful beyond the immediate context of your text processing needs. In preparing this proposal, we were challenged to reduce the scope of our current system, rather than, say, to stretch the limits of a system with less-comprehensive capabilities. Therefore please note that our proposed system can readily be upgraded and expanded, with CABLE: STANRES, MENLO PARK / TWX 910-373~1246 rapidly-increasing cost effectiveness, from the configuration proposed here. We shall look forward to presenting a demonstration in New York on March 7 (if that date is agreeable with your people) of the currently operating "NLS" system, upon which our proposed system for Chase Manhatten Bank will be based.
    [Show full text]
  • SRI ARC Journal
    DHC 27 —J UN— 73 10:50 17497 Unrecorded Journal Sometimes* I would like to use the Journal distribution capability. but do not want a NIC nuaber , nor do I want to have a copy of the note 'journalized'. Is there any possibllty of offerin sl th is capab11it y? 1 17497 Distribution Nps Np» Richard Watson} Charles H» Irby 1 DHC 27—JUN-73 Hi:50 17497 Unrecorded Journal (J17497) 27—JUN-73 10:50; Title: Author(s): David H. Crocker/DttC; Distribution: /NP; Sab-Collections: NIC NP; Clerk: DUC; NWG/'BFC# 537 SKB 27—JUN-73 12: 12 17498 Announcement of NGG meeti tig-J ULY 16-17 The proposed NGG meeting date of 16-JULY—73 has been 1 confirmed. The meeting will be held at the University 2 of Illinois on July 16 and 17. An informal meeting will 3 be held Sunday evening* July lb* to arrange the agenda. 4 The initial meeting place will be: 5 Room 201, Advanced Computation Building 5a 1101 Springfield 5b Urbanai III. 5c In the event that more space is needed, subsequent meetings may take place elsewhere. James Michener suggests that those attending be sure to have read his RFC 493 on graphics protocols. Local accoiaodatioas at Ramada Inn can be reserved by calling ( 800 )648—59701 t nei r toll-free number) or the local Inn, (217)352—7891. If you wish to make other arrangements, contact me and I will try to help. Airline reservations can best be handled by your local airline office. Jim suggested that I warn Ozark (the local service) of the upcoming surge of non-student, non- standby passengers in the hopes of getting better service.
    [Show full text]
  • RAND and the Information Evolution a History in Essays and Vignettes WILLIS H
    THE ARTS This PDF document was made available from www.rand.org as a public CHILD POLICY service of the RAND Corporation. CIVIL JUSTICE EDUCATION ENERGY AND ENVIRONMENT Jump down to document6 HEALTH AND HEALTH CARE INTERNATIONAL AFFAIRS NATIONAL SECURITY The RAND Corporation is a nonprofit research POPULATION AND AGING organization providing objective analysis and effective PUBLIC SAFETY solutions that address the challenges facing the public SCIENCE AND TECHNOLOGY and private sectors around the world. SUBSTANCE ABUSE TERRORISM AND HOMELAND SECURITY TRANSPORTATION AND INFRASTRUCTURE WORKFORCE AND WORKPLACE Support RAND Purchase this document Browse Books & Publications Make a charitable contribution For More Information Visit RAND at www.rand.org Learn more about the RAND Corporation View document details Limited Electronic Distribution Rights This document and trademark(s) contained herein are protected by law as indicated in a notice appearing later in this work. This electronic representation of RAND intellectual property is provided for non-commercial use only. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. Permission is required from RAND to reproduce, or reuse in another form, any of our research documents for commercial use. For information on reprint and linking permissions, please see RAND Permissions. This product is part of the RAND Corporation corporate publication series. Corporate publications describe or promote RAND divisions and programs, summarize research results, or announce upcoming events. RAND and the Information Evolution A History in Essays and Vignettes WILLIS H. WARE C O R P O R A T I O N Funding for the publication of this document was provided through a generous gift from Paul Baran, an alumnus of RAND, and support from RAND via its philanthropic donors and income from operations.
    [Show full text]
  • A Computer Program for Semantic Information Retrieval
    , -1 -, , -, i I T f -1 1:11 1 !, I I - i I 1. w:, . .- I 4 I L S IR: A COMPUTER PROGRAM FOR SEMANTIC INFORMATION RETRIEVAL by BERTRAM RAPHAEL B.S., Rensselaer Polytechnic Institute (1957) M.S., Brown University (1959) SUBMITTED N PARTIAL FULFILLMENI' OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHTLOSOPHY at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY June, 1964 Signature of Author ............................................. Department of Mathematics, April 1964 Certified by * . 0 - * . 0 ID 0 0 0 a * * * 0 0 0 . a a 0 0 V 1 0 .9 a Thesis Supervisor . a . 0 . 1 . v P , a '. P 0 0 . V F * * . 0 a * a Chairman, Departmental Committee on Graduate Students 2 Acknowledgement The work reported herein was supported in part by the MIT Compu- tation Center) and in part by Project MAC, an MIT research program sponsored by the Advanced Research Projects Agency, Department of Defense, under Office of Naval Research Contract Number Nonr-4102(01). Associated preliminary research was supported 'in part by the RAND Corporation, Santa Monica, California, and in part by Bolt, Beranek, and Newman, Inc.2 Cambridge, Massachusetts. The author expresses his gratitude to Prof. Marvin Minsky, for his supervision of this thesis; to Dr. Victor Yngve and Prof. Hartley Rogers, Jr., for their criticisms and suggestions; and to hs ife Anne for her unfailing confidence and encouragement, without which this thesis could not have been completed. III S IR - A COMPUTER PROGRAM FOR SEMANTIC INFORMATION RETRIEVAL by BERTRAM RAPHAEL Submitted to the Department of Mathematics on April 8, 1964, in-partial fulfillment of the requirements-for the degree of Doctor of Philosophy.
    [Show full text]
  • Future Directions 2007 Getting Ready for What Comes Next
    Future Directions 2007 Getting ready for what comes next '(ULFNVRQ-&ROOLHU60RQFNWRQ%%URWHQ-*LHVEUHFKW07UHQWLQL'+DQQD5 &KHVQH\'0DF.D\69HUUHW5$QGHUVRQ DefenceR&DCanada-Suffield 'HIHQFH5 '&DQDGD 7HFKQLFDO0HPRUDQGXP '5'&6XIILHOG70 'HFHPEHU Future Directions 2007 Getting ready for what comes next '(ULFNVRQ-&ROOLHU60RQFNWRQ%%URWHQ-*LHVEUHFKW07UHQWLQL'+DQQD5 &KHVQH\'0DF.D\69HUUHW5$QGHUVRQ DefenceR&DCanada-Suffield DefenceR&DCanada±Suffield TechnicalMemorandum DRDCSuffieldTM 'HFHPEHU2007 Author D. Erickson Defence R & D Canada - Suffield Approved by D. Hanna Head/Tactical Vehicle Systems Section Approved for release by Dr. R. Clewley Chairman/Document Review Panel © Her Majesty the Queen as represented by the Minister of National Defence, 2007 © Sa majesté la reine, représentée par le ministre de la Défense nationale, 2007 Abstract ThispapersummarizestheFutureDirections2007planningsymposium’soutcomes thatwasheldbyDRDCSuffieldstaffon17and18September2007.Participants proposedunconstrainedfutureautonomyscenarios,outliningwhattheysawasthenext step.Participantpresentationswereusedtoextractcommontimelinesandthemes aboutautonomoussystemsdevelopmentandmilitaryrobotics.Thissymposiumalso reviewedtheVWDWHRIWKHDUW,currentprograms,criticalresearchareas,andindicated promisingfutureresearchavenuesthatfitthecurrenttrends.Thesymposiumalso reviewedthepracticalityofreachingfullUnmannedVehicles(UxV)autonomyand recommendsamanintheloopsystemsconceptfortheforeseeablefuture.Giventhis systemconceptreality,itrecognizedanimportantshiftinfocustointroducemore “automaticity”soonerasanotherwaytoimpacttheclientandbringaboutautonomyin
    [Show full text]
  • Shakey 2016 - How Much Does It Take to Redo Shakey the Robot? David Speck, Christian Dornhege, and Wolfram Burgard
    IEEE ROBOTICS AND AUTOMATION LETTERS. PREPRINT VERSION. ACCEPTED JANUARY, 2017 1 Shakey 2016 - How Much Does it Take to Redo Shakey the Robot? David Speck, Christian Dornhege, and Wolfram Burgard Abstract—Shakey the robot was one of the first autonomous robots that showed impressive capabilities of navigation and mobile manipulation. Since then, robotics research has made great progress showing more and more capable robotic systems for a large variety of application domains and tasks. In this paper we look back on decades of research by rebuilding Shakey with modern robotics technology in the open-source Shakey 2016 system. Hereby we demonstrate the impact of research by showing that ideas from the original Shakey are still alive in state-of-the-art systems, while robotics in general has improved to deliver more robust and more capable software and hardware. Our Shakey 2016 system has been implemented on real robots and leverages mostly open-source software. We experimentally evaluate the system in real-world scenarios on a PR2 robot Fig. 1: Shakey at the Computer History Museum in Mountain View, California and a Turtlebot-based robot and particularly investigate the (left); The PR2 (middle) and the modified Turtlebot (right) used for the Shakey development effort. The experiments documented in this paper 2016 system. demonstrate that results from robotics research are readily available for building complex robots like Shakey within a short be gained. Another central point for the research community amount of time and little effort. is availability. Complex systems require multiple different components that are ideally available to any roboticist to be Index Terms—Autonomous Agents, AI-Based Methods able to utilize state-of-the-art algorithms.
    [Show full text]
  • A Timeline of Artificial Intelligence
    A Timeline of Artificial Intelligence by piero scaruffi | www.scaruffi.com All of these events are explained in my book "Intelligence is not Artificial". TM, ®, Copyright © 1996-2019 Piero Scaruffi except pictures. All rights reserved. 1960: Henry Kelley and Arthur Bryson invent backpropagation 1960: Donald Michie's reinforcement-learning system MENACE 1960: Hilary Putnam's Computational Functionalism ("Minds and Machines") 1960: The backpropagation algorithm 1961: Melvin Maron's "Automatic Indexing" 1961: Karl Steinbuch's neural network Lernmatrix 1961: Leonard Scheer's and John Chubbuck's Mod I (1962) and Mod II (1964) 1961: Space General Corporation's lunar explorer 1962: IBM's "Shoebox" for speech recognition 1962: AMF's "VersaTran" robot 1963: John McCarthy moves to Stanford and founds the Stanford Artificial Intelligence Laboratory (SAIL) 1963: Lawrence Roberts' "Machine Perception of Three Dimensional Solids", the birth of computer vision 1963: Jim Slagle writes a program for symbolic integration (calculus) 1963: Edward Feigenbaum's and Julian Feldman's "Computers and Thought" 1963: Vladimir Vapnik's "support-vector networks" (SVN) 1964: Peter Toma demonstrates the machine-translation system Systran 1965: Irving John Good (Isidore Jacob Gudak) speculates about "ultraintelligent machines" (the "singularity") 1965: The Case Institute of Technology builds the first computer-controlled robotic arm 1965: Ed Feigenbaum's Dendral expert system 1965: Gordon Moore's Law of exponential progress in integrated circuits ("Cramming more components
    [Show full text]