Probabilistic Robotics Sebastian Thrun-- Stanford

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

Localization and Map Making

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

CSE-473. A Gentle Introduction to Particle Filters

Data Fusion using Kalman Filter. Ioannis Rekleitis

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

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

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

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

Tracking. Many slides adapted from Kristen Grauman, Deva Ramanan

Tracking. Many slides adapted from Kristen Grauman, Deva Ramanan

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

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

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

Introduction to Mobile Robotics Probabilistic Robotics

Probability: Review. Pieter Abbeel UC Berkeley EECS. Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics

Probabilistic Robotics

Sequential Importance Resampling (SIR) Particle Filter

Kalman filtering for maximum likelihood estimation given corrupted observations.

Hidden Markov Models

Temporal probability models

An EM algorithm for maximum likelihood estimation given corrupted observations. E. E. Holmes, National Marine Fisheries Service

Using the Kalman filter Extended Kalman filter

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

Speech and Language Processing

Introduction to Mobile Robotics Summary

CS 4495 Computer Vision Tracking 1- Kalman,Gaussian

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

Temporal probability models. Chapter 15, Sections 1 5 1

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

7630 Autonomous Robotics Probabilistic Localisation

Advanced Control Systems Problem Sheet for Part B: Multivariable Systems

Introduction to Mobile Robotics

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

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

Probabilistic Robotics SLAM

Markov localization uses an explicit, discrete representation for the probability of all position in the state space.

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

Probabilistic Robotics SLAM

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

2016 Possible Examination Questions. Robotics CSCE 574

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

Probabilistic Robotics The Sparse Extended Information Filter

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

International Journal "Information Theories & Applications" Vol.10

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.

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

ON JENSEN S INEQUALITY FOR g-expectation

EKF SLAM vs. FastSLAM A Comparison

Miscellanea Miscellanea

HYPOTHESIS TESTING. four steps. 1. State the hypothesis. 2. Set the criterion for rejecting. 3. Compute the test statistics. 4. Interpret the results.

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

Mapping in Dynamic Environments

Linear Gaussian State Space Models

Computer Vision. Motion Extraction

Applied Mathematics Letters. Oscillation results for fourth-order nonlinear dynamic equations

Vehicle Arrival Models : Headway

Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach

References are appeared in the last slide. Last update: (1393/08/19)

A Bayesian Approach to Spectral Analysis

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

Block Diagram of a DCS in 411

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

Object Tracking. Computer Vision Jia-Bin Huang, Virginia Tech. Many slides from D. Hoiem

Probabilistic Robotics

Estimation of Poses with Particle Filters

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

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

An introduction to the theory of SDDP algorithm

Scalar Conservation Laws

Srednicki Chapter 20

Y. Xiang, Learning Bayesian Networks 1

Robot Motion Model EKF based Localization EKF SLAM Graph SLAM

2.160 System Identification, Estimation, and Learning. Lecture Notes No. 8. March 6, 2006

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

UNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences EECS 121 FINAL EXAM

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

Planning in POMDPs. Dominik Schoenberger Abstract

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

Vector autoregression VAR. Case 1

Mat 267 Engineering Calculus III Updated on 04/30/ x 4y 4z 8x 16y / 4 0. x y z x y. 4x 4y 4z 24x 16y 8z.

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

Pattern Classification (VI) 杜俊

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

Fundamental Problems In Robotics

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

Probabilistic Fundamentals in Robotics

Continuous Time Markov Chain (Markov Process)

Stochastic Structural Dynamics. Lecture-6

Space truss bridge optimization by dynamic programming and linear programming

Simultaneous Localisation and Mapping. IAR Lecture 10 Barbara Webb

Authors. Introduction. Introduction

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

Module: Principles of Financial Econometrics I Lecturer: Dr Baboo M Nowbutsing

Chapter 2. Models, Censoring, and Likelihood for Failure-Time Data

Computer Vision 2 Lecture 6

Transcription:

robabilisic Roboics Sebasian Thrn-- Sanford Inrodcion robabiliies Baes rle Baes filers

robabilisic Roboics Ke idea: Eplici represenaion of ncerain sing he calcls of probabili heor ercepion sae esimaion Acion ili opimiaion 2

Aioms of robabili Theor ra denoes probabili ha proposiion A is re. 0 r A r Tre r False 0 r A B r A + r B r A B 3

A Closer Look a Aiom 3 r A B r A + r B r A B Tre A A B B B 4

5 Using he Aioms r r 0 r r r r r r r r r r A A A A False A A Tre A A A A A A + + +

Discree Random Variables X denoes a random variable. X can ake on a conable nmber of vales in { 2 n }. X i or i is he probabili ha he random variable X akes on. vale i. is called probabili mass fncion. 6

Coninos Random Variables X akes on vales in he coninm. px or p is a probabili densi fncion. E.g. r a b p d p b a 7

Join and Condiional robabili X and Y If X and Y are independen hen is he probabili of given / If X and Y are independen hen 8

Law of Toal robabili Marginals Discree case Coninos case p d p p d p p p d 9

0 Baes Formla evidence prior likelihood

Normaliaion η η a : a a : η η Algorihm:

2 Condiioning Law of oal probabili: d d d

Baes Rle wih Backgrond Knowledge 3

4 Condiioning Toal probabili: d d d

Condiional Independence eqivalen o and 5

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

Casal vs. Diagnosic Reasoning open is diagnosic. open is casal. Ofen casal knowledge is easier o obain. Baes rle allows s o se casal knowledge: open con freqencies! open open 7

Eample open 0.6 open 0.3 open open 0.5 open open open open p open + open p open open 0.6 0.5 0.6 0.5 + 0.3 0.5 2 3 0.67 raises he probabili ha he door is open. 8

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

20 Recrsive Baesian 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 η η

2 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 probabili ha he door is open.

Acions Ofen he world is dnamic since acions carried o b he robo acions carried o b oher agens or js he ime passing b change he world. How can we incorporae sch acions? 23

Tpical Acions The robo rns is wheels o move The robo ses is maniplaor o grasp an objec lans grow over ime Acions are never carried o wih absole cerain. In conras o measremens acions generall increase he ncerain. 24

Modeling 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. 25

Eample: Closing he door 26

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

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

29 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 + + + +

Baes Filers: Framework Given: Sream of observaions and acion daa : Sensor model. Acion model. d { rior probabili of he ssem sae. Waned: Esimae of he sae X of a dnamical ssem. The poserior of he sae is also called Belief: Bel } 30

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

32 d Bel η Baes Filers η Baes observaion acion sae Bel Markov η Markov d η d η Toal prob. Markov d η

Bel η Bel d Baes Filer Algorihm. Algorihm Baes_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' 33

Baes Filers are Familiar! Bel η Bel d Kalman filers aricle filers Hidden Markov models Dnamic Baesian neworks ariall Observable Markov Decision rocesses OMDs 34

Smmar Baes rle allows s o compe probabiliies ha are hard o assess oherwise. Under he Markov assmpion recrsive Baesian pdaing can be sed o efficienl combine evidence. Baes filers are a probabilisic ool for esimaing he sae of dnamic ssems. 35