• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks

Cached

  • Download as a PDF

Download Links

  • [www.cs.berkeley.edu]
  • [robotics.caltech.edu]
  • [dslpitt.org]
  • [www.cs.cmu.edu]
  • [www.mne.psu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.berkeley.edu]
  • [www.cs.berkeley.edu]
  • [ftp.cs.berkeley.edu]
  • [www.cs.ubc.ca]
  • [www.ics.uci.edu]
  • [www.ai.mit.edu]
  • [www.ics.uci.edu]
  • [www.ics.uci.edu]
  • [www.cim.mcgill.ca]
  • [people.cs.ubc.ca]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Arnaud Doucet , Nando de Freitas , Kevin Murphy , Stuart Russell
Citations:348 - 11 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Doucet_rao-blackwellisedparticle,
    author = {Arnaud Doucet and Nando de Freitas and Kevin Murphy and Stuart Russell},
    title = {Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Particle filters (PFs) are powerful sampling-based inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of probability distribution, nonlinearity and non-stationarity. They have appeared in several fields under such names as “condensation”, “sequential Monte Carlo” and “survival of the fittest”. In this paper, we show how we can exploit the structure of the DBN to increase the efficiency of particle filtering, using a technique known as Rao-Blackwellisation. Essentially, this samples some of the variables, and marginalizes out the rest exactly, using the Kalman filter, HMM filter, junction tree algorithm, or any other finite dimensional optimal filter. We show that Rao-Blackwellised particle filters (RBPFs) lead to more accurate estimates than standard PFs. We demonstrate RBPFs on two problems, namely non-stationary online regression with radial basis function networks and robot localization and map building. We also discuss other potential application areas and provide references to some Þnite dimensional optimal filters.

Keyphrases

dynamic bayesian network    rao-blackwellised particle filtering    nite dimensional optimal filter    potential application area    finite dimensional optimal filter    particle filtering    accurate estimate    powerful sampling-based inference learning algorithm    principled way    sequential monte carlo    map building    non-stationary online regression    probability distribution    rao-blackwellised particle filter    hmm filter    radial basis function network    particle filter    kalman filter    junction tree algorithm    several field    standard pfs   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University