Probabilistic robotics
Download
1 / 64

Probabilistic Robotics - PowerPoint PPT Presentation


  • 149 Views
  • Uploaded on

Probabilistic Robotics. Bayes Filter Implementations Particle filters. Sample-based Localization (sonar). Particle Filters. Represent belief by random samples Estimation of non-Gaussian, nonlinear processes

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

PowerPoint Slideshow about 'Probabilistic Robotics' - jaden


An Image/Link below is provided (as is) to download presentation

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
Probabilistic robotics

Probabilistic Robotics

Bayes Filter Implementations

Particle filters



Particle filters
Particle Filters

  • Represent belief by random samples

  • Estimation of non-Gaussian, nonlinear processes

  • Monte Carlo filter, Survival of the fittest, Condensation, Bootstrap filter, Particle filter

  • Filtering: [Rubin, 88], [Gordon et al., 93], [Kitagawa 96]

  • Computer vision: [Isard and Blake 96, 98]

  • Dynamic Bayesian Networks: [Kanazawa et al., 95]d


Importance sampling
Importance Sampling

Weight samples: w = f / g


Importance sampling with resampling landmark detection example
Importance Sampling with Resampling:Landmark Detection Example



Distributions1
Distributions

Wanted: samples distributed according to p(x| z1, z2, z3)


This is easy
This is Easy!

We can draw samples from p(x|zl) by adding noise to the detection parameters.



Importance sampling with resampling1
Importance Sampling with Resampling

Weighted samples

After resampling







Particle filter algorithm
Particle Filter Algorithm

  • Algorithm particle_filter( St-1, ut-1 zt):

  • For Generate new samples

  • Sample index j(i) from the discrete distribution given by wt-1

  • Sample from using and

  • Compute importance weight

  • Update normalization factor

  • Insert

  • For

  • Normalize weights


Particle filter algorithm1

draw xit-1from Bel(xt-1)

draw xitfrom p(xt | xit-1,ut-1)

Importance factor for xit:

Particle Filter Algorithm


Resampling
Resampling

  • Given: Set S of weighted samples.

  • Wanted : Random sample, where the probability of drawing xi is given by wi.

  • Typically done n times with replacement to generate new sample set S’.


Resampling1

w1

wn

w2

Wn-1

w1

wn

w2

Wn-1

w3

w3

Resampling

  • Stochastic universal sampling

  • Systematic resampling

  • Linear time complexity

  • Easy to implement, low variance

  • Roulette wheel

  • Binary search, n log n


Resampling algorithm
Resampling Algorithm

  • Algorithm systematic_resampling(S,n):

  • For Generate cdf

  • Initialize threshold

  • For Draw samples …

  • While ( ) Skip until next threshold reached

  • Insert

  • Increment threshold

  • ReturnS’

Also called stochastic universal sampling



Proximity sensor model reminder
Proximity Sensor Model Reminder

Sonar sensor

Laser sensor








Vision based localization

P(z|x)

z

h(x)

Vision-based Localization


Under a light
Under a Light

Measurement z:

P(z|x):


Next to a light
Next to a Light

Measurement z:

P(z|x):


Elsewhere
Elsewhere

Measurement z:

P(z|x):




Application rhino and albert synchronized in munich and bonn
Application: Rhino and Albert Synchronized in Munich and Bonn

[Robotics And Automation Magazine, to appear]



Limitations
Limitations Bonn

  • 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)?


Approaches
Approaches Bonn

  • 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).


Random samples vision based localization
Random Samples BonnVision-Based Localization

936 Images, 4MB, .6secs/image

Trajectory of the robot:




Resulting trajectories
Resulting Trajectories Bonn

Position tracking:


Resulting trajectories1
Resulting Trajectories Bonn

Global localization:




Summary
Summary Bonn

  • 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.


ad