Using combinative proposal distribution in particle filtering algorithm

Fasheng Wang*, Qingjie Zhao, Liqun Zhang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Particle filtering has gained special attention in various fields due to its capacity to handle nonlinear/nonGaussian dynamic problems. One crucial issue in particle filtering is the selection of the proposal distribution that generates particles. In this paper, the particle filtering algorithm is improved by using more than one proposal distributions. Firstly, divide-conquer strategy is taken, and the particles used are divided into several parts. Then, they are drawn from different proposal distributions. Users can adjust the number of the particles drawn from specific proposal distributions according to their special requirements. We provide simulation results that show the efficiency and performance.

Original languageEnglish
Title of host publication2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007
Pages1146-1149
Number of pages4
DOIs
Publication statusPublished - 2007
Event2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007 - Shanghai, China
Duration: 21 Sept 200725 Sept 2007

Publication series

Name2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007

Conference

Conference2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007
Country/TerritoryChina
CityShanghai
Period21/09/0725/09/07

Keywords

  • Divide-conquer strategy
  • Particle filter
  • Proposal distribution

Fingerprint

Dive into the research topics of 'Using combinative proposal distribution in particle filtering algorithm'. Together they form a unique fingerprint.

Cite this