Markov Localization Bayes Filtering with Kalman Filters Discrete

Markov Localization & Bayes Filtering with Kalman Filters Discrete Filters Particle Filters Slides adapted from Thrun et al. , Probabilistic Robotics 1

Markov Localization The robot doesn’t know where it is. Thus, a reasonable initial believe of it’s position is a uniform distribution. 2

Markov Localization A sensor reading is made (USE SENSOR MODEL) indicating a door at certain locations (USE MAP). This sensor reading should be integrated with prior believe to update our believe (USE BAYES). 3

Markov Localization The robot is moving (USE MOTION MODEL) which adds noise. 4

Markov Localization A new sensor reading (USE SENSOR MODEL) indicates a door at certain locations (USE MAP). This sensor reading should be integrated with prior believe to update our believe (USE BAYES). 5

Markov Localization The robot is moving (USE MOTION MODEL) which adds noise. … 6

Bayes Formula 7

Bayes Rule with Background Knowledge 8

Normalization Algorithm: 9

Recursive Bayesian Updating Markov assumption: zn is independent of z 1, . . . , zn-1 if we know x. 10

Putting oberservations and actions together: Bayes Filters • Given: • Stream of observations z and action data u: • Sensor model P(z|x). • Action model P(x|u, x’). • Prior probability of the system state P(x). • Wanted: • Estimate of the state X of a dynamical system. • The posterior of the state is also called Belief: 11

Graphical Representation and Markov Assumption Underlying Assumptions • Static world • Independent noise • Perfect model, no approximation errors 12

Bayes Filters z = observation u = action x = state Bayes Markov Total prob. Markov 13

• Prediction • Correction

Bayes Filter Algorithm 1. 2. 3. 4. 5. 6. 7. 8. Algorithm Bayes_filter( Bel(x), d ): h=0 If d is a perceptual data item z then For all x do 9. Else if d is an action data item u then 10. For all x do 11. 12. Return Bel’(x) 15

Bayes Filters are Familiar! • Kalman filters • Particle filters • Hidden Markov models • Dynamic Bayesian networks • Partially Observable Markov Decision Processes (POMDPs) 16

17

Probabilistic Robotics Bayes Filter Implementations Gaussian filters SA-1

Gaussians m Univariate -s s Linear transform of Gaussians

Multivariate Gaussians • We stay in the “Gaussian world” as long as we start with Gaussians and perform only linear transformations.

Discrete Kalman Filter Estimates the state x of a discrete-time controlled process that is governed by the linear stochastic difference equation with a measurement 21

Linear Gaussian Systems: Initialization • Initial belief is normally distributed: 22

Linear Gaussian Systems: Dynamics • Dynamics are linear function of state and control plus additive noise: 23

Linear Gaussian Systems: Observations • Observations are linear function of state plus additive noise: 24

Kalman Filter Algorithm 1. Algorithm Kalman_filter( mt-1, St-1, ut, zt): 2. Prediction: 3. 4. 5. Correction: 6. 7. 8. 9. Return mt, St 25

Kalman Filter Summary • Highly efficient: Polynomial in measurement dimensionality k and state dimensionality n: O(k 2. 376 + n 2) • Optimal for linear Gaussian systems! • Most robotics systems are nonlinear! 26

Nonlinear Dynamic Systems • Most realistic robotic problems involve nonlinear functions 27

Linearity Assumption Revisited 28

Non-linear Function 29

EKF Linearization (1) 30

EKF Linearization (2) 31

EKF Linearization (3) 32

EKF Linearization: First Order Taylor Series Expansion • Prediction: • Correction: 33

EKF Algorithm 1. Extended_Kalman_filter( mt-1, St-1, ut, zt): 2. Prediction: 3. 4. 5. Correction: 6. 7. 8. 9. Return mt, St 34

Localization “Using sensory information to locate the robot in its environment is the most fundamental problem to providing a mobile robot with autonomous capabilities. ” [Cox ’ 91] • Given • Map of the environment. • Sequence of sensor measurements. • Wanted • Estimate of the robot’s position. • Problem classes • Position tracking • Global localization • Kidnapped robot problem (recovery) 35

Landmark-based Localization 36

EKF Summary • Highly efficient: Polynomial in measurement dimensionality k and state dimensionality n: O(k 2. 376 + n 2) • Not optimal! • Can diverge if nonlinearities are large! • Works surprisingly well even when all assumptions are violated! 37

Kalman Filter-based System • [Arras et al. 98]: • Laser range-finder and vision • High precision (<1 cm accuracy) [Courtesy of Kai Arras] 38

Multihypothesis Tracking 39

Localization With MHT • Belief is represented by multiple hypotheses • Each hypothesis is tracked by a Kalman filter • Additional problems: • Data association: Which observation corresponds to which hypothesis? • Hypothesis management: When to add / delete hypotheses? • Huge body of literature on target tracking, motion correspondence etc. 40

MHT: Implemented System (2) Courtesy of P. Jensfelt and S. Kristensen 41

Probabilistic Robotics Bayes Filter Implementations Discrete filters SA-1

Piecewise Constant 43

Discrete Bayes Filter Algorithm 1. 2. 3. 4. 5. 6. 7. 8. Algorithm Discrete_Bayes_filter( Bel(x), d ): h=0 If d is a perceptual data item z then For all x do 9. Else if d is an action data item u then 10. For all x do 11. 12. Return Bel’(x) 44

Grid-based Localization 45

Sonars and Occupancy Grid Map 46

Probabilistic Robotics Bayes Filter Implementations Particle filters SA-1

Sample-based Localization (sonar)

Particle Filters § § Represent belief by random samples § Monte Carlo filter, Survival of the fittest, Condensation, Bootstrap filter, Particle filter § § § Filtering: [Rubin, 88], [Gordon et al. , 93], [Kitagawa 96] Estimation of non-Gaussian, nonlinear processes Computer vision: [Isard and Blake 96, 98] Dynamic Bayesian Networks: [Kanazawa et al. , 95]d

Importance Sampling Weight samples: w = f / g

Importance Sampling with Resampling: Landmark Detection Example

Particle Filters

Sensor Information: Importance Sampling

Robot Motion

Sensor Information: Importance Sampling

Robot Motion

Particle Filter Algorithm 1. Algorithm particle_filter( St-1, ut-1 zt): 2. 3. For Generate new samples 4. Sample index j(i) from the discrete distribution given by wt-1 5. Sample from using and 6. Compute importance weight 7. Update normalization factor 8. Insert 9. For 10. Normalize weights

Particle Filter Algorithm draw xit-1 from Bel(xt-1) draw xit from p(xt | xit-1, ut-1) Importance factor for xit:

Motion Model Reminder Start

Proximity Sensor Model Reminder Laser sensor Sonar sensor

Initial Distribution 61

After Incorporating Ten Ultrasound Scans 62

After Incorporating 65 Ultrasound Scans 63

Estimated Path 64

Localization for AIBO robots

Limitations • The approach described so far is able to • track the pose of a mobile robot and to • globally localize the robot. • How can we deal with localization errors (i. e. , the kidnapped robot problem)? 66

Approaches • Randomly insert samples (the robot can be teleported at any point in time). • Insert random samples proportional to the average likelihood of the particles (the robot has been teleported with higher probability when the likelihood of its observations drops). 67

Global Localization 68

Kidnapping the Robot 69

Summary • Particle filters are an implementation of • • recursive Bayesian filtering They represent the posterior by a set of weighted samples. In the context of localization, the particles are propagated according to the motion model. They are then weighted according to the likelihood of the observations. In a re-sampling step, new particles are drawn with a probability proportional to the likelihood of the observation. 71