An introduction to Particle filtering

1 / 13

# An introduction to Particle filtering - PowerPoint PPT Presentation

Paul Sundvall www.s3.kth.se/~pauls Presentation in course “Optimal filtering” Signals, Sensors and Systems, KTH November 11th 2004. An introduction to Particle filtering. Outline. Introduction Comparison with the Kalman filter Description of the algorithm Implementation Example.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'An introduction to Particle filtering' - whitley

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Paul Sundvall

www.s3.kth.se/~pauls

Presentation in course “Optimal filtering”

Signals, Sensors and Systems, KTH

November 11th 2004

An introduction to Particle filtering
Outline
• Introduction
• Comparison with the Kalman filter
• Description of the algorithm
• Implementation
• Example

Paul Sundvall

Introduction

Particle filtering

• is a method for state estimation
• is a Monte Carlo method
• handles nonlinear models with non-Gaussian noise

Paul Sundvall

Kalman filter

Particle filter

State equation

Noise type

Output

Solution

Exact, optimal

Approximate

Computational speed

Fast

Slow

Comparison to the discrete Kalman filter

Any distribution, uni- or multimodal

Gaussian, unimodal

Paul Sundvall

Significant property

The particle filter gives an approximate solution to an exact model, rather than the optimal solution to an approximate model.

Paul Sundvall

Algorithm
• The propability density function is approximated using point weights
• Each point is called a particle
• Each particle has a positive weight

Basic algorithm:

• Initialize
• Time update (move particles)
• Measurement update (change weights)
• Resample (if needed)
• Goto 2 when new measurement arrives
• Each point is called a particle
• Each particle has a positive weight
• Initializew
Time Update

One-step prediction of each particle

Note that a realization of the

process noise is used for every

particle.

Measurement update
• The weights are adjusted using the measurement
• All weights are normalized
• Particles that can explain the measurement gain weight
• Particles far off the true state lose weight.
• The density of the cloud changes
Resampling
• It can be shown that the algorithm degenerates
• Allt particles but one become very light

Solved by resampling so that all weights become equal

Implementation
• Calculation demand is proportional to the number of particles
• The approximation error decreases as the number of particles grow
• N can easily be changed during runtime
• One needs to know what to do with p(x)

is not a good choice for multimodal distributions!

Example
• A boat travels on a one-dimensional sea
• Noisy depth measurements are given
• Given a perfect sea-chart d(x), estimate the position!
• Matlab code for the example is available on www.s3.kth.se/~pauls