A New Adaptive UPF Algorithm through Improved Relative Entropy

Article Preview

Abstract:

Unscented particle filter (UPF) has high accuracy of state estimation for nonlinear system with non-Gaussian noise. While the computation of traditional unscented particle filter is huge and this depends on the particle number. In this paper we propose a new adaptive unscented particle filter algorithm AUPF through improved relative entropy which can adaptively adjust the particle number during filtering. Firstly the relative entropy is used to measure the distance between the posterior probability density and the importance proposal and the least number of particles for the next time step is decided according to the relative entropy. Then the least number is adjusted to offset the difference between the importance proposal and the true distribution. This algorithm can effectively reduce unnecessary particles meanwhile reduce the computation. The simulation results show the effectiveness of AUPF.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

569-573

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M. Koohi, M. Narghi and A. Shakey: Canadian Journal on Image Processing and Computer Vision vol. 2 (2011), p.354.

Google Scholar

[2] G. Hendeby, R. Karlsson and F. Gustafsson: EURASIP Journal on Advances in Signal Processing vol. 22 (2010), p.1.

Google Scholar

[3] A. Doucet, E. Arnaudismacjp: Handbook of Nonlinear Filtering vol. 1 (2009), p.4.

Google Scholar

[4] X. Ning, J. Fang: Measurement Science and Technology vol. 19 (2008), p.1.

Google Scholar

[5] K. He, Z. Tang: Journal of Information and Computational Science vol. 8 (2011), p.431.

Google Scholar