Day 33 Range Sensor Models 12/10/2018.

Slides:



Advertisements
Similar presentations
Advanced Mobile Robotics
Advertisements

Likelihood Ratio, Wald, and Lagrange Multiplier (Score) Tests
Mapping with Known Poses
CSC321: 2011 Introduction to Neural Networks and Machine Learning Lecture 10: The Bayesian way to fit models Geoffrey Hinton.
Beam Sensor Models Pieter Abbeel UC Berkeley EECS Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics TexPoint fonts used in EMF. Read.
(Includes references to Brian Clipp
Lab 2 Lab 3 Homework Labs 4-6 Final Project Late No Videos Write up
SA-1 Probabilistic Robotics Probabilistic Sensor Models Beam-based Scan-based Landmarks.
Uncertainty Representation. Gaussian Distribution variance Standard deviation.
SA-1 Probabilistic Robotics Probabilistic Sensor Models Beam-based Scan-based Landmarks.
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.
First introduced in 1977 Lots of mathematical derivation Problem : given a set of data (data is incomplete or having missing values). Goal : assume the.
Scan Matching Pieter Abbeel UC Berkeley EECS
Navigation Jeremy Wyatt School of Computer Science University of Birmingham.
A Probabilistic Approach to Collaborative Multi-robot Localization Dieter Fox, Wolfram Burgard, Hannes Kruppa, Sebastin Thrun Presented by Rajkumar Parthasarathy.
SA-1 Probabilistic Robotics Mapping with Known Poses.
Grid Maps for Robot Mapping. Features versus Volumetric Maps.
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
Particle Filters++ TexPoint fonts used in EMF.
Binary Variables (1) Coin flipping: heads=1, tails=0 Bernoulli Distribution.
Particle Filters in high dimensions Peter Jan van Leeuwen and Mel Ades Data-Assimilation Research Centre DARC University of Reading Lorentz Center 2011.
Computer Vision Group Prof. Daniel Cremers Autonomous Navigation for Flying Robots Lecture 6.2: Kalman Filter Jürgen Sturm Technische Universität München.
Recap: Reasoning Over Time  Stationary Markov models  Hidden Markov models X2X2 X1X1 X3X3 X4X4 rainsun X5X5 X2X2 E1E1 X1X1 X3X3 X4X4 E2E2 E3E3.
Mapping and Localization with RFID Technology Matthai Philipose, Kenneth P Fishkin, Dieter Fox, Dirk Hahnel, Wolfram Burgard Presenter: Aniket Shah.
SA-1 Probabilistic Robotics Probabilistic Sensor Models Beam-based Scan-based Landmarks.
A Generalization of PCA to the Exponential Family Collins, Dasgupta and Schapire Presented by Guy Lebanon.
Forward-Scan Sonar Tomographic Reconstruction PHD Filter Multiple Target Tracking Bayesian Multiple Target Tracking in Forward Scan Sonar.
Image Restoration.
BCS547 Neural Decoding.
NCAF Manchester July 2000 Graham Hesketh Information Engineering Group Rolls-Royce Strategic Research Centre.
1/17/2016CS225B Kurt Konolige Probabilistic Models of Sensing and Movement Move to probability models of sensing and movement Project 2 is about complex.
Fast SLAM Simultaneous Localization And Mapping using Particle Filter A geometric approach (as opposed to discretization approach)‏ Subhrajit Bhattacharya.
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Learning Theory Reza Shadmehr Distribution of the ML estimates of model parameters Signal dependent noise models.
Autonomous Mobile Robots Autonomous Systems Lab Zürich Probabilistic Map Based Localization "Position" Global Map PerceptionMotion Control Cognition Real.
General approach: A: action S: pose O: observation Position at time t depends on position previous position and action, and current observation.
ELEC4600 Radar and Navigation Engineering
RF-based positioning.
Optimum Passive Beamforming in Relation to Active-Passive Data Fusion
Probabilistic Robotics
Day 32 Range Sensor Models 11/13/2018.
Lecture 10: Observers and Kalman Filters
LECTURE 05: THRESHOLD DECODING
Non-parametric Filters
Probability Review 11/22/2018.
Probabilistic Robotics
Distance Sensor Models
Coverage and Connectivity in Sensor Networks
Non-parametric Filters
Day 29 Bug Algorithms 12/7/2018.
Day 29 Bug Algorithms 12/8/2018.
Tutorial 7: General Random Variables 3
A Short Introduction to the Bayes Filter and Related Models
Non-parametric Filters
Non-parametric Filters
Motion Models (cont) 2/16/2019.
Probabilistic Map Based Localization
J. Ellis, F. Jenet, & M. McLaughlin
Principle of Bayesian Robot Localization.
Parametric Methods Berlin Chen, 2005 References:
Non-parametric Filters: Particle Filters
Introduction to Sensor Interpretation
CS723 - Probability and Stochastic Processes
Non-parametric Filters
Fundamental Problems in Mobile Robotics
Non-parametric Filters: Particle Filters
Introduction to Sensor Interpretation
Overview: Chapter 2 Localization and Tracking
Presentation transcript:

Day 33 Range Sensor Models 12/10/2018

Beam Models of Range Finders given the map and the robot’s location, find the probability density that the range finder detects an object at a distance along a beam the k is here because range sensors typically return many measurements at one time; e.g., the sensor might return a full 360 degree scan made up of K measurements at once 12/10/2018

Beam Models of Range Finders most range finders have a minimum and maximum range we seek a model that can represent the correct range measurement with noise unexpected obstacles failures random measurements 1 3 2 12/10/2018

Beam Models of Range Finders beam-based model is computationally expensive each measurement requires a ray intersection with the map to compute Velodyne HDL-64E S2 >1.3 million measurements per second 12/10/2018

Beam Models of Range Finders computational expense can be reduced by precomputing decompose state space into a 3D grid much like histogram filter for each grid location compute and store much faster than ray casting but… 12/10/2018

Beam Models of Range Finders changes abruptly for small changes in especially true for small changes in θ map obstacle detected for robot bearing θ map obstacle missed for robot bearing θ+d θ 12/10/2018

Likelihood Fields for Range Finders an alternative model called likelihood fields overcomes the limitations of the beam model but is not physically meaningful recall that a range measurement is a distance measured relative to the robot can we transform into a point in the map? 12/10/2018

Likelihood Fields for Range Finders want this in {0} measured in {1} measured in {0} 12/10/2018

Likelihood Fields for Range Finders 12/10/2018

Likelihood Fields for Range Finders similar to the beam model, we assume 3 types of sources of noise and uncertainty correct measurement with noise failures random measurements 12/10/2018

Likelihood Fields for Range Finders Correct Measurement with Noise once we have we find the point on an obstacle in the map that is nearest to and compute the distance d between those two points this measurement is modeled as a zero-mean Gaussian with variance 12/10/2018

Likelihood Fields for Range Finders 12/10/2018

Beam Models of Range Finders Failures range finders can fail to sense an obstacle in which case most sensors return modeled as a point mass distribution centered at 12/10/2018

Beam Models of Range Finders Random Measurements unexplainable measurements are modeled as a uniform distribution over the range [0, ] 12/10/2018

Beam Models of Range Finders the complete model is a weighted sum of the previous three densities with weights 12/10/2018

Beam Models of Range Finders 12/10/2018