Topological Path Planning JBNU, Division of Computer Science and Engineering Parallel Computing Lab Jonghwi Kim Introduction to AI Robots Chapter 9.

Slides:



Advertisements
Similar presentations
Mental Maps: Thinking Spatially. Do Now ► On the blank sheet of paper your received at the door, draw a map of Lindblom from memory. Include as much detail.
Advertisements

Chapter 2: Marr’s theory of vision. Cognitive Science  José Luis Bermúdez / Cambridge University Press 2010 Overview Introduce Marr’s distinction between.
MICHAEL MILFORD, DAVID PRASSER, AND GORDON WYETH FOLAMI ALAMUDUN GRADUATE STUDENT COMPUTER SCIENCE & ENGINEERING TEXAS A&M UNIVERSITY RatSLAM on the Edge:
University of Amsterdam Search, Navigate, and Actuate - Quantitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Quantative Navigation.
5/16/2015Intelligent Systems and Soft Computing1 Introduction Introduction Hebbian learning Hebbian learning Generalised Hebbian learning algorithm Generalised.
Artificial neural networks:
Search: Representation and General Search Procedure Jim Little UBC CS 322 – Search 1 September 10, 2014 Textbook § 3.0 –
Embedded System Lab Kim Jong Hwi Chonbuk National University Introduction to Intelligent Robots.
1 Last lecture  Configuration Space Free-Space and C-Space Obstacles Minkowski Sums.
Chapter 10 Artificial Intelligence © 2007 Pearson Addison-Wesley. All rights reserved.
ECE 7340: Building Intelligent Robots QUALITATIVE NAVIGATION FOR MOBILE ROBOTS Tod S. Levitt Daryl T. Lawton Presented by: Aniket Samant.
ECE 4340/7340 Exam #2 Review Winter Sensing and Perception CMUcam and image representation (RGB, YUV) Percept; logical sensors Logical redundancy.
Experiences with an Architecture for Intelligent Reactive Agents By R. Peter Bonasso, R. James Firby, Erann Gat, David Kortenkamp, David P Miller, Marc.
James Tam Introduction To Problem Solving This section will focus on problem solving strategies.
Integration of Representation Into Goal-Driven Behavior-Based Robots By Maja J. Mataric Presented by Murali Kiran. M.
Optimal Area Covering by Mobile Robot presented by: Nelly Chkolunov Fentahun Assefa-Dawit Fentahun Assefa-Dawit supervised by: Alexey Talyansky Technion.
Study on Mobile Robot Navigation Techniques Presenter: 林易增 2008/8/26.
CS292 Computational Vision and Language Visual Features - Colour and Texture.
Planetary Surface Robotics ENAE 788U, Spring 2005 U N I V E R S I T Y O F MARYLAND Lecture 8 Mapping 5 April, 2005.
Vision for mobile robot navigation Jannes Eindhoven
1/53 Key Problems Localization –“where am I ?” Fault Detection –“what’s wrong ?” Mapping –“what is my environment like ?”
Mobile Robot ApplicationsMobile Robot Applications Textbook: –T. Bräunl Embedded Robotics, Springer 2003 Recommended Reading: 1. J. Jones, A. Flynn: Mobile.
Chapter 11: Artificial Intelligence
Chapter 10 Artificial Intelligence. © 2005 Pearson Addison-Wesley. All rights reserved 10-2 Chapter 10: Artificial Intelligence 10.1 Intelligence and.
DARPA Mobile Autonomous Robot SoftwareLeslie Pack Kaelbling; March Adaptive Intelligent Mobile Robotics Leslie Pack Kaelbling Artificial Intelligence.
SPIE'01CIRL-JHU1 Dynamic Composition of Tracking Primitives for Interactive Vision-Guided Navigation D. Burschka and G. Hager Computational Interaction.
9 Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 9: Topological Path Planning1 Part II Chapter 9: Topological Path Planning.
Knowledge Management in Theory and Practice
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Report on Intrusion Detection and Data Fusion By Ganesh Godavari.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
University of Amsterdam Search, Navigate, and Actuate - Qualitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Qualitative Navigation.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 11: Artificial Intelligence Computer Science: An Overview Tenth Edition.
University of Windsor School of Computer Science Topics in Artificial Intelligence Fall 2008 Sept 11, 2008.
9 Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 9: Topological Path Planning1 Part II Chapter 9: Topological Path Planning.
Topological Neural Networks Bear, Connors & Paradiso (2001). Neuroscience: Exploring The Brain. Pg. 474.
Using RouteGraphs as an Appropriate Data Structure for Navigational Tasks SFB/IQN-Kolloquium Christian Mandel, A1-[RoboMap] Overview Goal scenario.
1 Research Question  Can a vision-based mobile robot  with limited computation and memory,  and rapidly varying camera positions,  operate autonomously.
Tapia Robotics 2009: Import Antigravity Kate Burgers '11, Becky Green '11, Sabreen Lakhani '11, Pam Strom '11 and Zachary Dodds In the summer of 2008,
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Turning Autonomous Navigation and Mapping Using Monocular Low-Resolution Grayscale Vision VIDYA MURALI AND STAN BIRCHFIELD CLEMSON UNIVERSITY ABSTRACT.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 25 –Robotics Thursday –Robotics continued Home Work due next Tuesday –Ch. 13:
Abstract A Structured Approach for Modular Design: A Plug and Play Middleware for Sensory Modules, Actuation Platforms, Task Descriptions and Implementations.
Chapter 10. The Explorer System in Cognitive Systems, Christensen et al. Course: Robots Learning from Humans On, Kyoung-Woon Biointelligence Laboratory.
Overivew Occupancy Grids -Sonar Models -Bayesian Updating
9 Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 9: Topological Path Planning1 Part II Chapter 9: Topological Path Planning.
Colour and Texture. Extract 3-D information Using Vision Extract 3-D information for performing certain tasks such as manipulation, navigation, and recognition.
1Lecture 8 Introduction to Systems Analysis l Objectives –Explain how systems analysis relates to business needs, problems, and opportunities –List and.
Database Management Systems, R. Ramakrishnan 1 Algorithms for clustering large datasets in arbitrary metric spaces.
Line Matching Jonghee Park GIST CV-Lab..  Lines –Fundamental feature in many computer vision fields 3D reconstruction, SLAM, motion estimation –Useful.
Clustering [Idea only, Chapter 10.1, 10.2, 10.4].
Network Management Lecture 13. MACHINE LEARNING TECHNIQUES 2 Dr. Atiq Ahmed Université de Balouchistan.
1. 2 What is Digital Image Processing? The term image refers to a two-dimensional light intensity function f(x,y), where x and y denote spatial(plane)
COGNITIVE APPROACH TO ROBOT SPATIAL MAPPING
Chapter 11: Artificial Intelligence
Chapter 11: Artificial Intelligence
Introduction to Wireless Sensor Networks
DIGITAL SIGNAL PROCESSING
State Machines Chapter 5.
Spatial Semantic Hierarchy (SSH)
Part II Chapter 9: Topological Path Planning
Test Planning Mike O’Dell (some edits by Vassilis Athitsos)
Introduction to Robot Mapping
Overivew Occupancy Grids -Sonar Models -Bayesian Updating
Robot Intelligence Kevin Warwick.
Prepared by: Mahmoud Rafeek Al-Farra
The Network Approach: Mind as a Web
Presentation transcript:

Topological Path Planning JBNU, Division of Computer Science and Engineering Parallel Computing Lab Jonghwi Kim Introduction to AI Robots Chapter 9

Chapter Objectives Define the difference between a natural and artificial landmark and give one example of each Given a description of an indoor office environment and a set of behaviors, build a relational graph representation labeling the distinctive places and local control strategies using gateways Describe in one or two sentences : gateway, image signature, visual homing, viewframe, orientation region Given a figure showing landmarks, create a topological map showing landmarks, landmark pair boundaries, and orientation regions

Contents Overview Landmarks and Gateways Relational Methods Associative Methods Case Study of Topological Navigation with a Hybrid Architecture Summary

Overview Route representations fall into one of two approaches : Relational  most popular  giving the robot an abbreviated, “connect the dots” graph-style of spatial memory  use an explicit representation, support path planning  focus on the graph-like representation of spatial memory Associative  better for retracing known paths  focus on coupling sensing with localization

Landmarks and Gateways Landmark  one or more perceptually distinctive features of interest on an object or locale of interest  not necessarily a single  can be a grouping of objects McDonald’s stand of aspen trees

Landmarks and Gateways Landmark  be either artificial or natural  “artificial” and “natural” ≠ “man-made” and “organic” artificial landmark  set of features added to an existing object or locale in order to either support recognition of the landmark or some other perceptual activity

Landmarks and Gateways Landmark natural landmark  configuration of existing features selected for recognition which were not expressly designed for the perceptual activity

Landmarks and Gateways Landmark  must satisfy three criteria Be readily recognizable Support the task dependent activity Be perceivable from many different viewpoints good landmark’s characteristics passive in order to be available despite a power failure should be perceivable over the entire range where the robot might need to see it should have distinctive features, and, if possible, unique feature

Landmarks and Gateways Gateway  an opportunity for a robot to change its overall direction of navigation  critical for localization, path planning, and map making

Relational Methods Relational methods  represent the world as a graph or network of nodes and edges Nodes gateways, landmarks, or goals Edges a navigable path between two nodes can attach additional information – direction(N,S,E,W), approximate distance, terrain type, the behaviors needed to navigate that path

Relational Methods Earliest relational graphs for navigation(Smith and Cheeseman)

Relational Methods Earliest relational graphs for navigation(Smith and Cheeseman)

Relational Methods Relational graphs for navigation(Kuipers and Byun)

Relational Methods Distinctive places  landmark that the robot could detect from a nearby region called a neighborhood

Associative Methods Associative methods  create a behavior which converts sensor observations into the direction to go to reach a particular landmark assumption perceptual stability : that views of the location that are close together should look similar perceptual distinguishability : that views far away should look different

Associative Methods Visual homing  work done by Nelson, and later by Engelson image signature created by partitioning an image into sections possible measurement edge density dominant edge orientation average intensity so on…

Associative Methods Visual homing

Associative Methods Visual homing

Associative Methods QualNav(qualitative navigation)  the ideas from Levitt and Lawton  for outdoor navigation over large distances as part of the Defense Advance Research Projects Agency (DARPA) Autonomous Land Vehicle (ALV) project in the late 1980’s

Associative Methods QualNav(qualitative navigation)

Case Study of Topological Navigation with a Hybrid Architecture  Case study of topological navigation using the SFX architecture in 1994 AAAI Mobile Robot Competition by a team of undergraduates form the Colorado School of Mines

Case Study of Topological Navigation with a Hybrid Architecture  placed in a random room  navigate out of the room and to another room within 15 minutes  be given a topological map  How the topological map was entered the activities of Cartographer  How scripts were used to simplify behavioral management, and the lessons learned

Case Study of Topological Navigation with a Hybrid Architecture Path planning a sample topological map start nodes direction blockages landmark

Case Study of Topological Navigation with a Hybrid Architecture Path planning  Cartographer input : a gateway type, start node, goal node output : a list of nodes representing the best path  preprocessing reclassifying (a hall to door connection as Hd) eliminates extraneous gateways  Task Manager select the appropriate abstract navigation behavior d

Case Study of Topological Navigation with a Hybrid Architecture Path planning

Case Study of Topological Navigation with a Hybrid Architecture Path planning

Case Study of Topological Navigation with a Hybrid Architecture Path planning

Case Study of Topological Navigation with a Hybrid Architecture Path planning

Case Study of Topological Navigation with a Hybrid Architecture Navigation scripts  used to specify and carry out the implied details of the plan  navigate-door ANB

Case Study of Topological Navigation with a Hybrid Architecture  navigate-hall ANB

Case Study of Topological Navigation with a Hybrid Architecture  navigate-foyer ANB

Case Study of Topological Navigation with a Hybrid Architecture Lessons learned critical to build the abstract navigation behaviors out of robust primitives (biggest problem is quality of the primitive behaviors) contention for sensing resource metric distance problem impact of obstacles

Summary Landmarks simplify the ‘Where am I?’ problem Gateways special landmarks which reflect a potencial for the robot to change directions navigation methods  relational distinctive places(nodes), local control strategies(lcs)  associative viewframe