SLAM: Simultaneous Localization and Mapping: Part II BY TIM BAILEY AND HUGH DURRANT-WHYTE Presented by Chang Young Kim These slides are based on: Probabilistic.

Slides:



Advertisements
Similar presentations
State Estimation and Kalman Filtering CS B659 Spring 2013 Kris Hauser.
Advertisements

EKF, UKF TexPoint fonts used in EMF.
Undelayed Initialization in Bearing-Only SLAM Joan Solà, André Monin, Michel Devy and Thomas Lemaire LAAS-CNRS Toulouse, France.
Probabilistic Robotics
Probabilistic Robotics
Probabilistic Robotics
Probabilistic Robotics SLAM. 2 Given: The robot’s controls Observations of nearby features Estimate: Map of features Path of the robot The SLAM Problem.
Advanced Mobile Robotics
(Includes references to Brian Clipp
Monte Carlo Localization for Mobile Robots Karan M. Gupta 03/10/2004
Robot Localization Using Bayesian Methods
The GraphSLAM Algorithm Daniel Holman CS 5391: AI Robotics March 12, 2014.
IR Lab, 16th Oct 2007 Zeyn Saigol
Lab 2 Lab 3 Homework Labs 4-6 Final Project Late No Videos Write up
Probabilistic Robotics
MCL -> SLAM. x: pose m: map u: robot motions z: observations.
Jose-Luis Blanco, Juan-Antonio Fernández-Madrigal, Javier González University of Málaga (Spain) Dpt. of System Engineering and Automation Sep Nice,
Simultaneous Localization and Mapping
Localization David Johnson cs6370. Basic Problem Go from thisto this.
Probabilistic Robotics: Kalman Filters
Autonomous Robot Navigation Panos Trahanias ΗΥ475 Fall 2007.
Reliable Range based Localization and SLAM Joseph Djugash Masters Student Presenting work done by: Sanjiv Singh, George Kantor, Peter Corke and Derek Kurth.
Robotic Mapping: A Survey Sebastian Thrun, 2002 Presentation by David Black-Schaffer and Kristof Richmond.
Adam Rachmielowski 615 Project: Real-time monocular vision-based SLAM.
Introduction to Kalman Filter and SLAM Ting-Wei Hsu 08/10/30.
Probabilistic Robotics
CS 547: Sensing and Planning in Robotics Gaurav S. Sukhatme Computer Science Robotic Embedded Systems Laboratory University of Southern California
SLAM: Simultaneous Localization and Mapping: Part I Chang Young Kim These slides are based on: Probabilistic Robotics, S. Thrun, W. Burgard, D. Fox, MIT.
Probabilistic Robotics
Part 2 of 3: Bayesian Network and Dynamic Bayesian Network.
Bayesian Filtering for Location Estimation D. Fox, J. Hightower, L. Liao, D. Schulz, and G. Borriello Presented by: Honggang Zhang.
Geometric Rays for Bearing-Only SLAM Joan Solà and Thomas Lemaire LAAS-CNRS Toulouse, France.
Overview and Mathematics Bjoern Griesbach
Particle Filters++ TexPoint fonts used in EMF.
ROBOT MAPPING AND EKF SLAM
Kalman filter and SLAM problem
Itamar Kahn, Thomas Lin, Yuval Mazor
Markov Localization & Bayes Filtering
/09/dji-phantom-crashes-into- canadian-lake/
9-1 SA-1 Probabilistic Robotics: SLAM = Simultaneous Localization and Mapping Slide credits: Wolfram Burgard, Dieter Fox, Cyrill Stachniss, Giorgio Grisetti,
3D SLAM for Omni-directional Camera
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.
(Wed) Young Ki Baik Computer Vision Lab.
Mapping and Localization with RFID Technology Matthai Philipose, Kenneth P Fishkin, Dieter Fox, Dirk Hahnel, Wolfram Burgard Presenter: Aniket Shah.
Probabilistic Robotics Bayes Filter Implementations Gaussian filters.
Young Ki Baik, Computer Vision Lab.
Real-Time Simultaneous Localization and Mapping with a Single Camera (Mono SLAM) Young Ki Baik Computer Vision Lab. Seoul National University.
City College of New York 1 Dr. Jizhong Xiao Department of Electrical Engineering City College of New York Advanced Mobile Robotics.
CSE-473 Mobile Robot Mapping. Mapping with Raw Odometry.
The Development of a Relative Point SLAM Algorithm and a Relative Plane SLAM Algorithm.
SLAM Tutorial (Part I) Marios Xanthidis.
10-1 Probabilistic Robotics: FastSLAM Slide credits: Wolfram Burgard, Dieter Fox, Cyrill Stachniss, Giorgio Grisetti, Maren Bennewitz, Christian Plagemann,
SLAM Techniques -Venkata satya jayanth Vuddagiri 1.
Probabilistic Robotics Bayes Filter Implementations Gaussian filters.
SIFT.
SLAM : Simultaneous Localization and Mapping
Marginalization and sliding window estimation
CSE-473 Mobile Robot Mapping.
Probabilistic Robotics Graph SLAM
Robótica Móvil CC5316 Clase 16: SLAM
Paper – Stephen Se, David Lowe, Jim Little
+ SLAM with SIFT Se, Lowe, and Little Presented by Matt Loper
Simultaneous Localization and Mapping
CARNEGIE MELLON UNIVERSITY
Introduction to Robot Mapping
Jose-Luis Blanco, Javier González, Juan-Antonio Fernández-Madrigal
Probabilistic Robotics
Simultaneous Localization and Mapping
Probabilistic Robotics Bayes Filter Implementations FastSLAM
Presentation transcript:

SLAM: Simultaneous Localization and Mapping: Part II BY TIM BAILEY AND HUGH DURRANT-WHYTE Presented by Chang Young Kim These slides are based on: Probabilistic Robotics, S. Thrun, W. Burgard, D. Fox, MIT Press, 2005 Many images are also taken from Probabilistic Robotics.

Overview Review SLAM  Reducing complexity State Augmentation Partitioned Updates Sparsification  Data association Batch Gating SIFT Multi-Hypothesis Future works

What is SLAM? Given:  The robot’s controls  Observations of nearby features Estimate:  Map of features  Path of the robot A robot is exploring an unknown, static environment.

Terminology Robot State (or pose):  Position and heading  Robot Controls:  Robot motion and manipulation  Sensor Measurements:  Range scans, images, etc.  Landmark or Map:  Landmarks or Map z t u t x t = ( x ; y ; µ ) x 1 : t = f x 1 ; x 2 ; ::: ; x t g u 1 : t = f u 1 ; u 2 ; ::: ; u t g z 1 : t = f z 1 ; z 2 ; ::: ; z t }

Terminology Observation model: or  The probability of a measurement z t given that the robot is at position x t and map m. Motion Model:  The posterior probability that action u t carries the robot from x t-1 to x t.

SLAM algorithm Prediction Update

7 EKF State Space Model Prediction Update where

Maintaining values: Bel(x t,m) and its covariance matrix P t. Map with N landmarks:(3+2N)-dimensional Gaussian. 8 EKF-SLAM

Overview Review SLAM  Reducing complexity State Augmentation Partitioned Updates Sparsification  Data association Batch Gating SIFT Multi-Hypothesis Future works

Complexity O(N 3) with N landmarks due to the covariance matrix and matrix multiplication of Jacobian. Can handle hundreds of dimensions? It can be reduced by approximation methods:  State Augmentation for the prediction stage  Partitioned Updates for the update stage  Sparsification using an information form 10 EKF-SLAM : Complexity

11 State Augmentation Prediction : Solution : State Augmentation Separating the state into an augmented states Update only affected matrixes Static

State Augmentation Covariance prediction State Augmentation Static O(N 3 ) O(N)

13 Partitioned Updates Update : Solution : Partitioned Update with local submap. Confines the map to a small local region. Only Updates the small local region. Updates the whole map only at a much lower frequency

Partitioned Updates Local State : Global State:Periodically registers Updated by Local SLAM

State Bel(x t,m) and covariance matrix P t are Gaussian probability density which, implicitly describes the two central moments of Gaussian Using Moment or Information Form Sparsification P t Y t Many of none diagonal components are very close to 0  they can be set to zero. Sparsification

Covariance prediction Sparsification using the information form O(N 3 ) O(N)

Overview Review SLAM  Computational complexity State Augmentation Partitioned Updates Sparsification  Data association Batch Gating SIFT Multi-Hypothesis Future works

Data Association Problem A robust SLAM must consider possible data associations Solutions: three key methods :  Batch Gating  SIFT  Multi-Hypothesis Which observation belongs to which landmark?

Batch Gating Basic Principle of Batch: RANSAC Gating : constrained by robot position estimation  If true robot movement is ==> the left case is chosen by using the gating

Batch Gating is not enough for reliable data association SIFT features have “landmark-quality” for SLAM  SIFT correspondences tend to be reliable and recognizable under variable conditions Gating  If true robot movement is ==> the left case is chosen by using the gating SIFT

Multi-Hypothesis Data Association Multi-hypothesis data association  Generate a separate track estimate for each association hypothesis.  Low-likelihood tracks are pruned FastSLAM is inherently a Multi-hypothesis solution because its data association is done on a per-particle basis. Landmark 1Landmark 2Landmark M … x, y,  Landmark 1Landmark 2Landmark M … x, y,  Particle #1 Landmark 1Landmark 2Landmark M … x, y,  Particle #2 Particle N …

Per-Particle Data Association Was the observation generated by the red or the blue landmark? P(observation|red) = 0.3P(observation|blue) = 0.7 Per-particle data association  Pick the most probable match If the probability is too low, generate a new landmark

Future Woks Large scale mapping  including many vehicles  in mixed environments  with sensor networks and dynamic landmark. The delayed data-fusion concept instead of batch association and iterative smoothing to improve estimation quality and robustness