Overivew Occupancy Grids -Sonar Models -Bayesian Updating

Slides:



Advertisements
Similar presentations
Mapping with Known Poses
Advertisements

Monte Carlo Localization for Mobile Robots Karan M. Gupta 03/10/2004
IR Lab, 16th Oct 2007 Zeyn Saigol
1 Slides for the book: Probabilistic Robotics Authors: Sebastian Thrun Wolfram Burgard Dieter Fox Publisher: MIT Press, Web site for the book & more.
SA-1 Probabilistic Robotics Probabilistic Sensor Models Beam-based Scan-based Landmarks.
10 Chapter 10: Metric Path Planning a. Representations b. Algorithms.
Robotic Mapping: A Survey Sebastian Thrun, 2002 Presentation by David Black-Schaffer and Kristof Richmond.
Experiences with an Architecture for Intelligent Reactive Agents By R. Peter Bonasso, R. James Firby, Erann Gat, David Kortenkamp, David P Miller, Marc.
Dempster-Shafer Theory SIU CS 537 4/12/11 and 4/14/11 Chet Langin.
Probabilistic Robotics Introduction Probabilities Bayes rule Bayes filters.
Christian Siagian Laurent Itti Univ. Southern California, CA, USA
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.
Grid Maps for Robot Mapping. Features versus Volumetric Maps.
COMP14112 : Artificial Intelligence Fundamentals L ecture 0 –Very Brief Overview Lecturer: Xiao-Jun Zeng
1/53 Key Problems Localization –“where am I ?” Fault Detection –“what’s wrong ?” Mapping –“what is my environment like ?”
Sonar-Based Real-World Mapping and Navigation by ALBERTO ELFES Presenter Uday Rajanna.
The City College of New York 1 Dr. John (Jizhong) Xiao Department of Electrical Engineering City College of New York Mobile Robot Mapping.
N.B. Please register for the course with the ITO Please attend a practical in the coming week: –Either 10:00, 13:05 Tuesday –Or 10:00, 13:05 Friday If.
1 Constant Following Distance Simulations CS547 Final Project December 6, 1999 Jeremy Elson.
Localisation & Navigation
Mapping and Localization for Robots The Occupancy Grid Approach.
Lab 4 1.Get an image into a ROS node 2.Find all the orange pixels (suggest HSV) 3.Identify the midpoint of all the orange pixels 4.Explore the findContours.
9 Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 9: Topological Path Planning1 Part II Chapter 9: Topological Path Planning.
SA-1 Mapping with Known Poses Ch 4.2 and Ch 9. 2 Why Mapping? Learning maps is one of the fundamental problems in mobile robotics Maps allow robots to.
Simultaneous Localization and Mapping Presented by Lihan He Apr. 21, 2006.
Visibility Graph. Voronoi Diagram Control is easy: stay equidistant away from closest obstacles.
Recognizing Activities of Daily Living from Sensor Data Henry Kautz Department of Computer Science University of Rochester.
1 Robot Environment Interaction Environment perception provides information about the environment’s state, and it tends to increase the robot’s knowledge.
7 Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 7: Hybrid Deliberative/Reactive Paradigm1 Part 1: Overview & Managerial.
SA-1 Probabilistic Robotics Probabilistic Sensor Models Beam-based Scan-based Landmarks.
Robotica Lecture 3. 2 Robot Control Robot control is the mean by which the sensing and action of a robot are coordinated The infinitely many possible.
University of Amsterdam Search, Navigate, and Actuate - Qualitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Qualitative Navigation.
10 Chapter 10: Metric Path Planning a. Representations b. Algorithms.
Belief-Function Formalism Computes the probability that the evidence supports a proposition Also known as the Dempster-Shafer theory Bayesian Formalism.
11 Chapter 11: Localization and Map Making a. Occupancy Grids b. Evidential Methods c. Exploration 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.
Topological Path Planning JBNU, Division of Computer Science and Engineering Parallel Computing Lab Jonghwi Kim Introduction to AI Robots Chapter 9.
City College of New York 1 Dr. Jizhong Xiao Department of Electrical Engineering City College of New York Advanced Mobile Robotics.
Computer Vision Group Prof. Daniel Cremers Autonomous Navigation for Flying Robots Lecture 5.3: Reasoning with Bayes Law Jürgen Sturm Technische Universität.
CHAPTER 5 Probability Theory (continued) Introduction to Bayesian Networks.
4 Proposed Research Projects SmartHome – Encouraging patients with mild cognitive disabilities to use digital memory notebook for activities of daily living.
Robotics Club: 5:30 this evening
Range-Only SLAM for Robots Operating Cooperatively with Sensor Networks Authors: Joseph Djugash, Sanjiv Singh, George Kantor and Wei Zhang Reading Assignment.
Chapter 10. The Explorer System in Cognitive Systems, Christensen et al. Course: Robots Learning from Humans On, Kyoung-Woon Biointelligence Laboratory.
9 Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 9: Topological Path Planning1 Part II Chapter 9: Topological Path Planning.
1/17/2016CS225B Kurt Konolige Probabilistic Models of Sensing and Movement Move to probability models of sensing and movement Project 2 is about complex.
1 Energy-Efficient Mobile Robot Exploration Yongguo Mei, Yung-Hsiang Lu Purdue University ICRA06.
Probabilistic Robotics
Probabilistic Robotics Introduction Probabilities Bayes rule Bayes filters.
Learning Roomba Module 5 - Localization. Outline What is Localization? Why is Localization important? Why is Localization hard? Some Approaches Using.
Planning Strategies RSS II Lecture 6 September 21, 2005.
Probabilistic Robotics Probability Theory Basics Error Propagation Slides from Autonomous Robots (Siegwart and Nourbaksh), Chapter 5 Probabilistic Robotics.
General approach: A: action S: pose O: observation Position at time t depends on position previous position and action, and current observation.
Matching ® ® ® Global Map Local Map … … … obstacle Where am I on the global map?                                   
Probabilistic Robotics Bayes Filter Implementations Gaussian filters.
Automation as the Subject of Mechanical Engineer’s interest
Sensors and Sensing for Reactive Robots
Simultaneous Localization and Mapping
Part II Chapter 9: Topological Path Planning
Markov ó Kalman Filter Localization
© James D. Skrentny from notes by C. Dyer, et. al.
State Estimation Probability, Bayes Filtering
CSE-490DF Robotics Capstone
Probabilistic Robotics
Overivew Occupancy Grids -Sonar Models -Bayesian Updating
A Short Introduction to the Bayes Filter and Related Models
Chapter 7: Hybrid Deliberative/Reactive Paradigm
Chapter 10: Metric Path Planning.
Principle of Bayesian Robot Localization.
Presentation transcript:

Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Chapter 11: Localization and Map Making a. Occupancy Grids b. Evidential Methods c. Exploration

Chapter 11: Localization and Map Making Objectives Describe the difference between iconic and feature-based localization Be able to update an occupancy grid using either Bayesian, DS, or HIMM Describe the two types of formal exploration strategies Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Where am I going? Mission planning What’s the best way there? Path planning Where have I been? Map making Where am I? Localization Navigation Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Carto- grapher Mission Planner deliberative How am I going to get there? Behaviors reactive Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Motivation Can make topological or metric maps, localize relative to landmark(s) or at any point More desirable: metric maps, localize at any point More readable by a human GPS isn’t the answer Localization error is on order of 1 meter Reception difficult indoors Want to know where features in environment are, not just robot (e.g., layout of walls, not just robot’s path) Sensor measurements have some uncertainty that must be factored in Formal methods called “evidential reasoning”, “theories of evidence” Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Basic Idea Integrate local map Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Global map Move D Local map Sense and create a local map Move a little Record change in position, orientation Fuse/tile together Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Observations about Process Map is almost always a type of regular grid (because easier to visualize) The “Move D” and “Integrate local map” are the hard part. Integration requires accurate measurement of D (on order of inches and <=5 degrees) Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Black Is ground Truth, Purple is Measured Using shaft Encoders for D Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Iconic vs. Feature-Based Issue is how to localize at each step to accurately measure D, then integrate local map Iconic: use raw (or near raw) sensor readings Match elements marked “empty” or “occupied” in a regular grid OCCUPANCY GRID Plug and chug, intense computations Feature-based: use features extracted from raw data Label and match corners, walls, whatever Less features, so less computations Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Occupancy Grids Type of regular grid L: eLement Came out of sonar tradition Each element is marked with belief that L is empty or occupied Usually a number on a scale [0,1] for probability and possibility theories [0-15] for HIMM Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Sonars and Occupancy Grids Everything element L “under” the sonar beam gets marked with some value for empty, occupied Exact value depends on Sonar model Evidential method Generic sonar model 3 regions R: theoretical range, r: measured range b: half angle Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Evidential Methods for Occupancy Grids Bayesian Popularized by Hans Moravec Dempster-Shafer HIMM Johan Borenstein Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Bayesian Compute the value for each L for each sonar using sonar model The value of L is a probability Compute the value for each L where sonars overlap uses Bayes’ rule for updating Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Go to board and work example from book. This gives students a chance to write down notes, otherwise slides go too fast. Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Example: Value of L in Region II Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Class Exercise: Value of L in Region I Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Other Issues An element L may have multiple “hits” Robot moves and senses subset of same area, Sonars overlap: what to do? Use Bayes’ rule to update If write a program to use Bayes’ rule, what’s the initialization of the occupancy grid? P(Occupied)=P(Empty)=0.5 Is this a good assumption? Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Summary Localization and map making are intertwined Localization requires good maps Map making requires good localization Map making and localization techniques often use occupancy grids Type of regular grid Elements represent uncertainty of being empty, occupied Multiple ways of combining uncertainty when an element has multiple “hits” Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Dempster-Shafer Theory & HIMM On board Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Iconic: uses raw sensor data directly Ex. Sonar and laser readings fused in an occupancy grid Compare current and past reading Feature-based: uses features extracted from sensor data Ex. “corners”, “walls” Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary ? Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Iconic Example: ARIEL Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Issues k must be small to be tractable, but k must be large if noisy sensors Doesn’t work with “just sonars” Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Iconic Example: ARIEL Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Results Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Exploration Can explore reactively (move to open area as per Donath), but we’d like to create maps Two major methods Frontier-based GVG Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Frontier Based Exploration Robot senses environment Borders of low certainty form frontiers Rate the frontiers Centroid Utility of exploring (big? Close?) Move robot to the centroid and repeat (continuously localize and map as you go) Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making GVG Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Keeps moving, ignores areas hard to get too Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Reaches deadend at 9, backtracks Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Goes back and catches missing areas Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Discussion of Exploration Both methods work OK indoors, not so clear on utility outdoors GVG Susceptible to noise, hard to recover nodes Frontier Have to rate the frontiers so don’t trash Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making

Chapter 11: Localization and Map Making Summary Map making requires Localization and acurate measurements Exploration Localization and map making often use Occupancy grids Evidential methods for updating Bayesian DS HIMM (quasi-evidential) Two kinds of localization: iconic, feature-based Two popular methods for exploration: frontier-based, GVG Overivew Occupancy Grids -Sonar Models -Bayesian Updating -Dempster-Shafer -HIMM Localization -ARIEL Exploration -Frontier-based -GVG Summary Introduction to AI Robotics (MIT Press), copyright Robin Murphy 2000 Chapter 11: Localization and Map Making