TY - GEN
T1 - Particle filter based on PSO
AU - Zhang, Gongyuan
AU - Cheng, Yongmei
AU - Yang, Feng
AU - Pan, Quan
PY - 2008
Y1 - 2008
N2 - The main challenge in using particle filter (PF) to nonlinear state estimation problem is the particle degeneracy. Resampling operation solves degeneracy to some extent, but it results in the phenomenon of sample impoverishment. Therefore, it cannot achieve the satisfactory accuracy generally with certain number particles by using generic PF algorithm because of the serious impoverishment problem. Here we aim for decreasing the impoverishment of samples set after resampling step. The principle of PF together with its particle degeneracy and sample impoverishment problems are introduced in this paper. Based on the analysis of the causes of sample impoverishment, particle swarm optimization (PSO) which is one of the swarm intelligence algorithms is introduced to PF to ameliorate the diversity of samples set after resampling step. Thus a new algorithm which is called PSO-PF is proposed. From a theoretical analysis, the PSO operation on particles set can overcome sample impoverishment problem largely. And finally, a generic numerical example shows that PSO-PF presents better than generic PF algorithm regarding to accuracy.
AB - The main challenge in using particle filter (PF) to nonlinear state estimation problem is the particle degeneracy. Resampling operation solves degeneracy to some extent, but it results in the phenomenon of sample impoverishment. Therefore, it cannot achieve the satisfactory accuracy generally with certain number particles by using generic PF algorithm because of the serious impoverishment problem. Here we aim for decreasing the impoverishment of samples set after resampling step. The principle of PF together with its particle degeneracy and sample impoverishment problems are introduced in this paper. Based on the analysis of the causes of sample impoverishment, particle swarm optimization (PSO) which is one of the swarm intelligence algorithms is introduced to PF to ameliorate the diversity of samples set after resampling step. Thus a new algorithm which is called PSO-PF is proposed. From a theoretical analysis, the PSO operation on particles set can overcome sample impoverishment problem largely. And finally, a generic numerical example shows that PSO-PF presents better than generic PF algorithm regarding to accuracy.
UR - http://www.scopus.com/inward/record.url?scp=57949100942&partnerID=8YFLogxK
U2 - 10.1109/ICICTA.2008.262
DO - 10.1109/ICICTA.2008.262
M3 - 会议稿件
AN - SCOPUS:57949100942
SN - 9780769533575
T3 - Proceedings - International Conference on Intelligent Computation Technology and Automation, ICICTA 2008
SP - 121
EP - 124
BT - Proceedings - International Conference on Intelligent Computation Technology and Automation, ICICTA 2008
T2 - International Conference on Intelligent Computation Technology and Automation, ICICTA 2008
Y2 - 20 October 2008 through 22 October 2008
ER -