Introduction to Mobile Robotics Mapping with Known Poses

Similar documents
Mapping in Dynamic Environments

WILD Estimating Abundance for Closed Populations with Mark-Recapture Methods

Localization. MEM456/800 Localization: Bayes Filter. Week 4 Ani Hsieh

BEST LINEAR FORECASTS VS. BEST POSSIBLE FORECASTS

BE.430 Tutorial: Linear Operator Theory and Eigenfunction Expansion

STK4080/9080 Survival and event history analysis

Ideal Amplifier/Attenuator. Memoryless. where k is some real constant. Integrator. System with memory

OLS bias for econometric models with errors-in-variables. The Lucas-critique Supplementary note to Lecture 17

ES 330 Electronics II Homework 03 (Fall 2017 Due Wednesday, September 20, 2017)

Review Answers for E&CE 700T02

Optimum design of complementary transient experiments for estimating thermal properties

Chapter 3 Moments of a Distribution

Extremal graph theory II: K t and K t,t

In this section we will study periodic signals in terms of their frequency f t is said to be periodic if (4.1)

1.225J J (ESD 205) Transportation Flow Systems

Big O Notation for Time Complexity of Algorithms

C(p, ) 13 N. Nuclear reactions generate energy create new isotopes and elements. Notation for stellar rates: p 12

Paper Introduction. ~ Modelling the Uncertainty in Recovering Articulation from Acoustics ~ Korin Richmond, Simon King, and Paul Taylor.

A Probabilistic Nearest Neighbor Filter for m Validated Measurements.

Chemistry 1B, Fall 2016 Topics 21-22

Procedia - Social and Behavioral Sciences 230 ( 2016 ) Joint Probability Distribution and the Minimum of a Set of Normalized Random Variables

b : the two eigenvectors of the Grover iteration Quantum counting algorithm

Sequential Importance Resampling (SIR) Particle Filter

BAYESIAN ESTIMATION METHOD FOR PARAMETER OF EPIDEMIC SIR REED-FROST MODEL. Puji Kurniawan M

Chapter 2. Foundations of quantum mechanics

EXAMPLE SHEET B (Partial Differential Equations) SPRING 2014

Clock Skew and Signal Representation

CHARACTERIZATIONS OF THE NON-UNIFORM IN TIME ISS PROPERTY AND APPLICATIONS

F D D D D F. smoothed value of the data including Y t the most recent data.

Probabilistic Robotics SLAM

Development of Kalman Filter and Analogs Schemes to Improve Numerical Weather Predictions

FOR 496 / 796 Introduction to Dendrochronology. Lab exercise #4: Tree-ring Reconstruction of Precipitation

Spectral Simulation of Turbulence. and Tracking of Small Particles

The Recovery of Rockets.

A note on deviation inequalities on {0, 1} n. by Julio Bernués*

Stationarity and Error Correction

CLOSED FORM EVALUATION OF RESTRICTED SUMS CONTAINING SQUARES OF FIBONOMIAL COEFFICIENTS

Dynamic h-index: the Hirsch index in function of time

Probabilistic Robotics

Lecture 15 First Properties of the Brownian Motion

TELEOPERATION OF MOBILE ROBOTS

Extended Laguerre Polynomials

A Generalized Cost Malmquist Index to the Productivities of Units with Negative Data in DEA

Statistical Estimation

12 Getting Started With Fourier Analysis

Probabilistic Robotics SLAM

Affine term structure models

Electrical Engineering Department Network Lab.

L-functions and Class Numbers

Intro to multivariate AR(1) models estimating interaction strengths, aka the B matrix

E will be denoted by n

N! AND THE GAMMA FUNCTION

ECE-314 Fall 2012 Review Questions

A Bayesian Approach for Detecting Outliers in ARMA Time Series

Bernstein Direct Method for Solving. Variational Problems

Introduction to Mobile Robotics

Comparison between Fourier and Corrected Fourier Series Methods

An Analysis of State Evolution for Approximate Message Passing with Side Information

Math 6710, Fall 2016 Final Exam Solutions

On Modeling On Minimum Description Length Modeling. M-closed

The analysis of the method on the one variable function s limit Ke Wu

Energy Density / Energy Flux / Total Energy in 1D. Key Mathematics: density, flux, and the continuity equation.

Lecture 8 April 18, 2018

Lecture 9: Polynomial Approximations

Moment Generating Function

Basic Magnetism Thorsten Glaser, University of Münster. Basic Magnetism. 1. Paramagnetism and Diamagnetism (macroscopic)

Class 36. Thin-film interference. Thin Film Interference. Thin Film Interference. Thin-film interference

Using Linnik's Identity to Approximate the Prime Counting Function with the Logarithmic Integral

The Importance of Ordering the Number of Lattice Points Inside a Rational Polyhedron Using Generating Functions

Optimum Receivers for the AWGN channel

14.02 Principles of Macroeconomics Fall 2005

Exercise 3 Stochastic Models of Manufacturing Systems 4T400, 6 May

6.003: Signals and Systems Lecture 20 April 22, 2010

Notes 03 largely plagiarized by %khc

A Note on Prediction with Misspecified Models

Numerical methods for ordinary differential equations

K3 p K2 p Kp 0 p 2 p 3 p

ODEs II, Supplement to Lectures 6 & 7: The Jordan Normal Form: Solving Autonomous, Homogeneous Linear Systems. April 2, 2003

Page 1. Before-After Control-Impact (BACI) Power Analysis For Several Related Populations. Richard A. Hinrichsen. March 3, 2010

Mixture models (cont d)

New Class of Estimators of Population Mean. DECISION SCIENCES INSTITUTE New Class of Estimators of Population Mean Utilizing Median of Study Variable

A quadratic convergence method for the management equilibrium model

David Randall. ( )e ikx. k = u x,t. u( x,t)e ikx dx L. x L /2. Recall that the proof of (1) and (2) involves use of the orthogonality condition.

Probabilistic Robotics The Sparse Extended Information Filter

Higher-order Adaptive Iterative Control for Uncertain Robot Manipulators *

Local Influence Diagnostics of Replicated Data with Measurement Errors

Discrete-Time Signals and Systems. Introduction to Digital Signal Processing. Independent Variable. What is a Signal? What is a System?

1 Notes on Little s Law (l = λw)

MCR3U FINAL EXAM REVIEW (JANUARY 2015)

Complementary Approaches for a Clustering Problem. Edson L.F. Senne*, Luiz A.N. Lorena**

Towards Efficiently Solving Quantum Traveling Salesman Problem

Multi-Attribute Group Decision Making based on Bidirectional Projection Measure

Announcements. Recap: Filtering. Recap: Reasoning Over Time. Example: State Representations for Robot Localization. Particle Filtering

6/10/2014. Definition. Time series Data. Time series Graph. Components of time series. Time series Seasonal. Time series Trend

Adaptive Visual Servoing of Micro Aerial Vehicle with Switched System Model for Obstacle Avoidance

Union-Find Partition Structures

CSE-571 Robotics. Sample-based Localization (sonar) Motivation. Bayes Filter Implementations. Particle filters. Density Approximation

Calculus BC 2015 Scoring Guidelines

On Acoustic Radiation by Rotating Dipole Sources in Frequency Domain

So, given the value x generated by the computer, we solve this equation for y, which now has the

Transcription:

Iroducio o Mobile Roboics Mappig wih Kow Poses Wolfra Burgard Cyrill Sachiss Mare Beewi Kai Arras

Why Mappig? Learig aps is oe of he fudaeal probles i obile roboics Maps allow robos o efficiely carry ou heir asks allow localiaio Successful robo syses rely o aps for localiaio pah plaig aciviy plaig ec. 2

The Geeral Proble of Mappig Wha does he eviroe look like? 3

The Geeral Proble of Mappig Forally appig ivolves give he sesor daa d { u u 2 2 u } o calculae he os likely ap * arg ax P d 4

Mappig as a Chicke ad Egg Proble So far we leared how o esiae he pose of he vehicle give he daa ad he ap. Mappig however ivolves o siulaeously esiae he pose of he vehicle ad he ap. The geeral proble is herefore deoed as he siulaeous localiaio ad appig proble SLAM. Throughou his secio we will describe how o calculae a ap give we kow he pose of he vehicle. 5

Types of SLAM-Probles Grid aps or scas [Lu & Milios 97; Gua 98: Thru 98; Burgard 99; Koolige & Gua 00; Thru 00; Arras 99; Haehel 0; ] Ladark-based [Leoard e al. 98; Caselaos e al. 99: Dissaayake e al. 200; Moeerlo e al. 2002; 6

Probles i Mappig Sesor ierpreaio How do we exrac releva iforaio fro raw sesor daa? How do we represe ad iegrae his iforaio over ie? Robo locaios have o be esiaed How ca we ideify ha we are a a previously visied place? This proble is he so-called daa associaio proble. 7

Occupacy Grid Maps Iroduced by Moravec ad Elfes i 985 Represe eviroe by a grid. Esiae he probabiliy ha a locaio is occupied by a obsacle. Key assupios Occupacy of idividual cells [xy] is idepede Bel P u 2 u x y Robo posiios are kow! Bel [ xy ] 8

Updaig Occupacy Grid Maps Idea: Updae each idividual cell usig a biary Bayes filer. Bel [ xy] η p [ xy] p [ xy] [ xy] u Bel [ xy] d [ xy] Addiioal assupio: Map is saic. Bel η p Bel [ xy ] [ xy ] [ xy ] 9

Updaig Occupacy Grid Maps Updae he ap cells usig he iverse sesor odel Bel [ xy ] [ xy ] P u + [ xy ] P u [ xy ] P [ xy ] Or use he log-odds represeaio [ xy ] [ ] xy P Bel Bel [ xy ] [ xy ] [ xy ] [ xy ] B log odds u B : logodds [ xy logodds ] P x odds x : [ xy ] P x + B 0

Typical Sesor Model for Occupacy Grid Maps Cobiaio of a liear fucio ad a Gaussia:

Key Paraeers of he Model 2

Occupacy Value Depedig o he Measured Disace +d +d 2 +d 3 -d 3

Deviaio fro he Prior Belief he sphere of ifluece of he sesors 4

Calculaig he Occupacy Probabiliy Based o Sigle Observaios 5

Icreeal Updaig of Occupacy Grids Exaple 6

Resulig Map Obaied wih Ulrasoud Sesors 7

Resulig Occupacy ad Maxiu Likelihood Map The axiu likelihood ap is obaied by clippig he occupacy grid ap a a hreshold of 0.5 8

Occupacy Grids: Fro scas o aps 9

Tech Museu Sa Jose CAD ap occupacy grid ap 20

Aleraive: Siple Couig For every cell cou hisxy: uber of cases where a bea eded a <xy> issesxy: uber of cases where a bea passed hrough <xy> Bel [ xy ] his x his x y y + isses x y Value of ieres: Preflecsxy 2

22 The Measuree Model 0 0 0 if if k k x f x f k k x f x p ς ς ς. pose a ie : 2. bea of sca : 3. axiu rage readig: 4. bea refleced by a obec: 0 ς x 0 x f

23 Copuig he Mos Likely Map Copue values for ha axiie Assuig a uifor prior probabiliy for p his is equivale o axiiig applic. of Bayes rule ax arg * x x P T T x P x P x x P * l arg ax arg ax ax arg

24 Copuig he Mos Likely Map + 0 * l l arg ax k J T N k x f I x f I ς Suppose T N x f I ς α T N k k x f I 0 β

Meaig of α ad β α T N I f x ς correspods o he uber of ies a bea ha is o a axiu rage bea eded i cell his β T N k 0 I f x k correspods o he uber of ies a bea ierceped cell wihou edig i i isses. 25

Copuig he Mos Likely Map We assue ha all cells are idepede: * J arg ax α l If we se α β 0 + β l we obai α α + β Copuig he os likely ap aous o couig how ofe a cell has refleced a easuree ad how ofe i was ierceped. 26

Differece bewee Occupacy Grid Maps ad Couig The couig odel deeries how ofe a cell reflecs a bea. The occupacy odel represes wheher or o a cell is occupied by a obec. Alhough a cell igh be occupied by a obec he reflecio probabiliy of his obec igh be very sall. 27

Exaple Occupacy Map 28

Exaple Reflecio Map glass paes 29

Exaple Ou of 000 beas oly 60% are refleced fro a cell ad 40% iercep i wihou edig i i. Accordigly he reflecio probabiliy will be 0.6. Suppose pocc 0.55 whe a bea eds i a cell ad pocc 0.45 whe a cell is ierceped by a bea ha does o ed i i. Accordigly afer easurees we will have 0.55 0.45 *0.6 * 0.45 0.55 *0.4 9 *0.6 * 9 *0.4 9 *0.2 Whereas he reflecio ap yields a value of 0.6 he occupacy grid value coverges o. 30

Suary Occupacy grid aps are a popular approach o represe he eviroe of a obile robo give kow poses. I his approach each cell is cosidered idepedely fro all ohers. I sores he poserior probabiliy ha he correspodig area i he eviroe is occupied. Occupacy grid aps ca be leared efficiely usig a probabilisic approach. Reflecio aps are a aleraive represeaio. They sore i each cell he probabiliy ha a bea is refleced by his cell. We provided a sesor odel for copuig he likelihood of easurees ad showed ha he couig procedure uderlyig reflecio aps yield he opial ap. 3