DocumentCode
3047334
Title
Particle filter resampling based on optimized combinatorial algorithm
Author
Li, Rui ; Mao, Li ; Zhang, Jiurui
Author_Institution
Sch. of Comput. & Commun., LanZhou Univ. of Technol., Lanzhou, China
Volume
2
fYear
2011
fDate
9-11 Dec. 2011
Firstpage
27
Lastpage
30
Abstract
In particle Alter algorithm, the resampling step effectively solves the problem of particles degeneracy; however, it reduces the particle variety. This article describes how to use chaos, immunity algorithm and genetic algorithm carried on particle resampling corrective method. We present a novel algorithm which combines immune algorithm, chaos and genetic algorithm. This immune genetic algorithm based on chaos initializes cluster by the over-spread character and randomicity of chaos to improve search speed and renews cluster by chaos sequence and enhancing cluster diversity to avoid local optimization. Chaos also is adopts to optimize the local optimization to increase precision. After crossover and mutation, using chaotic local optimization near the optimal solution to enhance the precision of the solutions. The experimental results show that it has the quicker convergence rate and the better iterative estimating capability, compared with the particle resampling based on the immunity genetic algorithm.
Keywords
genetic algorithms; object tracking; particle filtering (numerical methods); sampling methods; genetic algorithm; immunity algorithm; moving objects tracking; optimized combinatorial algorithm; particle filter resampling; particle resampling corrective method; chaos; genetic algorithm; immune algorithm; particle filtering; resampling;
fLanguage
English
Publisher
ieee
Conference_Titel
IT in Medicine and Education (ITME), 2011 International Symposium on
Conference_Location
Cuangzhou
Print_ISBN
978-1-61284-701-6
Type
conf
DOI
10.1109/ITiME.2011.6132049
Filename
6132049
Link To Document