IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/302170.html
   My bibliography  Save this article

Improved Rao-Blackwellized Particle Filter by Particle Swarm Optimization

Author

Listed:
  • Zeng-Shun Zhao
  • Xiang Feng
  • Yan-yan Lin
  • Fang Wei
  • Shi-Ku Wang
  • Tong-Lu Xiao
  • Mao-Yong Cao
  • Zeng-Guang Hou
  • Min Tan

Abstract

The Rao-Blackwellized particle filter (RBPF) algorithm usually has better performance than the traditional particle filter (PF) by utilizing conditional dependency relationships between parts of the state variables to estimate. By doing so, RBPF could not only improve the estimation precision but also reduce the overall computational complexity. However, the computational burden is still too high for many real-time applications. To improve the efficiency of RBPF, the particle swarm optimization (PSO) is applied to drive all the particles to the regions where their likelihoods are high in the nonlinear area. So only a small number of particles are needed to participate in the required computation. The experimental results demonstrate that this novel algorithm is more efficient than the standard RBPF.

Suggested Citation

  • Zeng-Shun Zhao & Xiang Feng & Yan-yan Lin & Fang Wei & Shi-Ku Wang & Tong-Lu Xiao & Mao-Yong Cao & Zeng-Guang Hou & Min Tan, 2013. "Improved Rao-Blackwellized Particle Filter by Particle Swarm Optimization," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-7, August.
    • Handle: RePEc:hin:jnljam:302170
    DOI: 10.1155/2013/302170
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2013/302170.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/JAM/2013/302170.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/302170?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhengqing Fu & Lanlan Guo, 2019. "Tikhonov Regularized Variable Projection Algorithms for Separable Nonlinear Least Squares Problems," Complexity, Hindawi, vol. 2019, pages 1-9, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnljam:302170. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.