Localization and Map Making

Similar documents
Probabilistic Robotics Sebastian Thrun-- Stanford

Introduction to Bayesian Estimation. McGill COMP 765 Sept 12 th, 2017

Anno accademico 2006/2007. Davide Migliore

Uncertainty & Localization I

Recursive Bayes Filtering Advanced AI

AUTONOMOUS SYSTEMS. Probabilistic Robotics Basics Kalman Filters Particle Filters. Sebastian Thrun

Probabilistic Robotics

CSE-473. A Gentle Introduction to Particle Filters

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017

Hidden Markov Models

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

Introduction to Mobile Robotics

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II

SEIF, EnKF, EKF SLAM. Pieter Abbeel UC Berkeley EECS

State-Space Models. Initialization, Estimation and Smoothing of the Kalman Filter

Probabilistic Robotics SLAM

Probabilistic Robotics SLAM

4.2 Continuous-Time Systems and Processes Problem Definition Let the state variable representation of a linear system be

Sequential Importance Resampling (SIR) Particle Filter

Estimation of Poses with Particle Filters

7630 Autonomous Robotics Probabilistic Localisation

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

Data Fusion using Kalman Filter. Ioannis Rekleitis

Using the Kalman filter Extended Kalman filter

Introduction to Mobile Robotics Summary

EKF SLAM vs. FastSLAM A Comparison

Robot Motion Model EKF based Localization EKF SLAM Graph SLAM

Augmented Reality II - Kalman Filters - Gudrun Klinker May 25, 2004

Temporal probability models

Applications in Industry (Extended) Kalman Filter. Week Date Lecture Title

Localization. Mobile robot localization is the problem of determining the pose of a robot relative to a given map of the environment.

2016 Possible Examination Questions. Robotics CSCE 574

Temporal probability models. Chapter 15, Sections 1 5 1

Fundamental Problems In Robotics

Georey E. Hinton. University oftoronto. Technical Report CRG-TR February 22, Abstract

Introduction to Mobile Robotics SLAM: Simultaneous Localization and Mapping

Chapter 14. (Supplementary) Bayesian Filtering for State Estimation of Dynamic Systems

Tracking. Many slides adapted from Kristen Grauman, Deva Ramanan

Speech and Language Processing

Tracking. Many slides adapted from Kristen Grauman, Deva Ramanan

Mapping in Dynamic Environments

Vehicle Arrival Models : Headway

Probabilistic Fundamentals in Robotics

Deep Learning: Theory, Techniques & Applications - Recurrent Neural Networks -

Authors. Introduction. Introduction

Algorithms for Sensor-Based Robotics: Kalman Filters for Mapping and Localization

0.1 MAXIMUM LIKELIHOOD ESTIMATION EXPLAINED

Scalar Conservation Laws

Object tracking: Using HMMs to estimate the geographical location of fish

CS 4495 Computer Vision Tracking 1- Kalman,Gaussian

Simultaneous Localisation and Mapping. IAR Lecture 10 Barbara Webb

Tracking. Announcements

Solutions to the Exam Digital Communications I given on the 11th of June = 111 and g 2. c 2

CptS 570 Machine Learning School of EECS Washington State University. CptS Machine Learning 1

Overview. COMP14112: Artificial Intelligence Fundamentals. Lecture 0 Very Brief Overview. Structure of this course

Stochastic Structural Dynamics. Lecture-6

Notes on Kalman Filtering

Non-parametric techniques. Instance Based Learning. NN Decision Boundaries. Nearest Neighbor Algorithm. Distance metric important

L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS. NA568 Mobile Robotics: Methods & Algorithms

I Let E(v! v 0 ) denote the event that v 0 is selected instead of v I The block error probability is the union of such events

An introduction to the theory of SDDP algorithm

Experiments on Individual Classifiers and on Fusion of a Set of Classifiers

HYPOTHESIS TESTING. four steps. 1. State the hypothesis and the criterion. 2. Compute the test statistic. 3. Compute the p-value. 4.

Financial Econometrics Kalman Filter: some applications to Finance University of Evry - Master 2

Kalman filtering for maximum likelihood estimation given corrupted observations.

Recognising Behaviours of Multiple People with Hierarchical Probabilistic Model and Statistical Data Association

Probabilistic Robotics The Sparse Extended Information Filter

Linear Gaussian State Space Models

Self assessment due: Monday 4/29/2019 at 11:59pm (submit via Gradescope)

Tom Heskes and Onno Zoeter. Presented by Mark Buller

Modal identification of structures from roving input data by means of maximum likelihood estimation of the state space model

Non-parametric techniques. Instance Based Learning. NN Decision Boundaries. Nearest Neighbor Algorithm. Distance metric important

A Bayesian Approach to Spectral Analysis

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

Viterbi Algorithm: Background

Planning in POMDPs. Dominik Schoenberger Abstract

Written HW 9 Sol. CS 188 Fall Introduction to Artificial Intelligence

Recent Developments In Evolutionary Data Assimilation And Model Uncertainty Estimation For Hydrologic Forecasting Hamid Moradkhani

1.1. Example: Polynomial Curve Fitting 4 1. INTRODUCTION

Article from. Predictive Analytics and Futurism. July 2016 Issue 13

Graphical Event Models and Causal Event Models. Chris Meek Microsoft Research

Kriging Models Predicting Atrazine Concentrations in Surface Water Draining Agricultural Watersheds

m = 41 members n = 27 (nonfounders), f = 14 (founders) 8 markers from chromosome 19

ST2352. Stochastic Processes constructed via Conditional Simulation. 09/02/2014 ST2352 Week 4 1

Monte Carlo data association for multiple target tracking

Advanced Control Systems Problem Sheet for Part B: Multivariable Systems

Simultaneous Localization and Mapping with Unknown Data Association Using FastSLAM

מקורות לחומר בשיעור ספר הלימוד: Forsyth & Ponce מאמרים שונים חומר באינטרנט! פרק פרק 18

CSE/NB 528 Lecture 14: Reinforcement Learning (Chapter 9)

Energy Storage Benchmark Problems

ON JENSEN S INEQUALITY FOR g-expectation

Testing for a Single Factor Model in the Multivariate State Space Framework

The Research of Active Disturbance Rejection Control on Shunt Hybrid Active Power Filter

Recursive Least-Squares Fixed-Interval Smoother Using Covariance Information based on Innovation Approach in Linear Continuous Stochastic Systems

Stable approximations of optimal filters

Online Convex Optimization Example And Follow-The-Leader

Probabilistic Robotics. Slides from Autonomous Robots (Siegwart and Nourbaksh), Chapter 5 Probabilistic Robotics (S. Thurn et al.

Random Processes 1/24

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing

Reliability of Technical Systems

Transcription:

Localiaion and Map Making My old office DILab a UTK ar of he following noes are from he book robabilisic Roboics by S. Thrn W. Brgard and D. Fo

Two Remaining Qesions Where am I? Localiaion Where have I been? Map-making

Moivaion Can make opological map localie relaive o landmarks More desirable: meric maps localie a any poin more readable by a hman GS isn he answer Localiaion error is meer Indoor Wan o know he feares of he environmen no js he robo There are ncerainies ha ms be facored in: probabilisic roboics

Localiaion Eample

Coasal Navigaion Eample

robabilisic Roboics Key idea: represen ncerainy eplicily sing he calcls of probabiliy heory Insead of relying on a single bes gess we have a whole space of gesses Topics: Basic conceps in probabiliy Bayes filers Localiaion Mapping

Discree robabiliies X denoes a random variable. X can ake on a conable nmber of vales in { 2 n }. X= i or i is he probabiliy ha he random variable X akes on vale i. E.g. flip a coin Discree probabiliies sm o one

Coninos Random Variables X akes on vales in he coninm. px= or p is a probabiliy densiy fncion pdf. r a b p d b a p p d

Gassian Fncion Gassian fncion is a common - dimensional disribion N; μ; σ 2 p = 2πσ 2 -/2 ep{--μ 2 /2σ 2 } Mean; variance Defines widh of bell Defines heigh of bell Defines posiion of bell s peak From wikipedia

Join and Condiional robabiliy X= and Y=y = y If X and Y are independen hen y = y y y is he probabiliy of given y y = y / y or y = y y If X and Y are independen hen y =

Law of Toal robabiliy Discree case y y y y y Coninos case p d p p y p p y p y dy dy B 3 B 2 B 5 B 4 p A B A B A i i B B 7 B 6

Bayes Formla smmaries he knowledge we have regarding X prior o incorporaing he daa y y is he poserior probabiliy disribion over X y describes how sae variables X case sensor measremen Y evidence prior likelihood y y y y y y y y

Normaliaion Since y does no depend on Symbol η indicaes ha he final resl has o be normalied o y y y y y y

Condiioning I s perfecly fine o condiion any rle discssed so far on arbirary random variables sch as he variable Z Condiioning of probabiliies will pdae hem o ake accon of possible new informaion We eend he Bayes rle: y y y

Condiional Independence Condiion he rle for combining probabiliies of independen random variables y y eqivalen o y and y y I applies whenever a variable y carries no informaion abo a variable if anoher variable s vale is known

Law of Toal robabiliy d y y y d d

Robo Environmen Ineracion

Environmens and Saes Environmens are characeried by sae which incldes: robo pose y yaw locaion and feares of srronding objecs in he environmen landmarks disincive places locaion and velociies of moving objecs and people ec. The sae a ime will be denoed which will be called complee if i is he bes predicor of he fre Compleeness enails ha knowledge of pas saes measremens or conrols carry no addiional informaion ha wold help s predic he fre more accraely

Environmen Ineracion Environmen sensor measremen he daa a ime is denoed Z :2 = Z Z + Z 2 Conrol acions change he sae of he world conrol daa a ime is denoed :2 = + 2 robabilisic Generaive Laws The sae is generaed sochasically from - Sae ransiion probabiliy: p 0:- :- : = p - Measremen probabiliy: p 0:- :- : = p

Dynamic Sochasic Sysem Hidden Markov Model HMM Or Dynamic Bayes Nework DBN Sae ransiion probabiliy + measremen probabiliy

Simple Eample of Sae Esimaion Sppose a robo obains measremen Wha is open?

Casal vs. Diagnosic Reasoning open is diagnosic. open is casal. Ofen casal knowledge is easier o obain. Bayes rle allows s o se casal knowledge: open open open

Eample open = 0.6 open = 0.3 open = open = 0.5 open open open open p open open p open open 0.60.5 0.60.5 0.30.5 2 3 0.67 raises he probabiliy ha he door is open.

Combining Evidence Sppose or robo obains anoher observaion 2. How can we inegrae his new informaion? More generally how can we esimae... n?

Recrsive Bayesian Updaing n n n n n n Markov assmpion: n is independen of... n- if we know....... n i i n n n n n n n n recrsively

Eample: Second Measremen 2 open = 0.5 2 open = 0.6 open =2/3 0.625 8 5 3 5 3 3 2 2 3 2 2 2 2 2 2 open open open open open open open 2 lowers he probabiliy ha he door is open.

Incorporaing Acions To incorporae he ocome of an acion ino he crren belief we se he condiional pdf This erm specifies he pdf ha eecing changes he sae from o.

Eample: Closing he door

Sae Transiions for = close door : 0.9 0. open closed If he door is open he acion close door scceeds in 90% of all cases. 0

Inegraing he Ocome of Acions Coninos case: ' ' d' Discree case: ' '

Eample: The Resling Belief 6 8 3 0 8 5 0 ' ' 6 5 8 3 8 5 0 9 ' ' closed closed closed open open open open open open closed closed closed open open closed closed closed

Belief Disribion A belief reflecs robo s inernal knowledge abo sae of environmen A belief disribion assigns a probabiliy o each possible hypohesis wih regards o he re sae We denoe belief over by bel an abbr. for he poserior bel = p.... Can be calclaed from he following bel by incorporaing he sensor measremen hs he correcion or measremen pdae Calclae a poserior before incorporaing js afer eecing conrol bel = p..-.. I predics he sae a ime based on previos sae hs he predicion sep

Bayes Filers: Framework Given: Sream of observaions and acion daa : Sensor model. Acion model. rior probabiliy of he sysem sae. Waned: d { Esimae of he sae X of a dynamical sysem. The poserior of he sae is also called Belief: } Bel

Markov Assmpion Underlying Assmpions Saic world Independen noise erfec model no approimaion errors : : : p p : : : 0 p p

Bayes Filers = observaion = acion = sae d Bel Bayes Bel Markov Markov d d Toal prob. Markov d

Bayes Bel Filer Algorihm Bel d. Algorihm Bayes_filer Beld : 2. 0 3. If d is a percepal daa iem hen 4. For all do 5. 6. 7. For all do 8. 9. Else if d is an acion daa iem hen 0. For all do. 2. Rern Bel Bel' Bel Bel' Bel' Bel' Bel' ' Bel ' d'

Eample work on board

Markov Assmpion Violaions: Unmodeled dynamics no inclded in Inaccracies in he prob. Models error in he map for a localiing robo Approimaion errors Gassian disribion ec. Incomplee sae represenaions are preferable o more complee ones o redce compleiy of he Bayes filer Bayes filer is pracically robs o sch violaions Need o careflly define

Bayes Filer Applicaions Robo localiaion: Observaions are range readings Saes are posiions on a map Speech recogniion: Observaions are acosic signals Saes are specific posiions in specific words Machine ranslaion: Observaions are words Saes are ranslaion opions

Eample: Robo Localiaion

Eample: Robo Localiaion

Eample: Robo Localiaion

Eample: Robo Localiaion

Eample: Robo Localiaion

Eample: Robo Localiaion

Smmary Bayes rle allows s o compe probabiliies ha are hard o assess oherwise. Under he Markov assmpion recrsive Bayesian pdaing can be sed o efficienly combine evidence. Bayes filers are a probabilisic ool for esimaing he sae of dynamic sysems.