Please use this identifier to cite or link to this item:
Title: Parallel resampling particle filter algorithm
Authors: Bi, J
Fung, Y
Ho, T
Mao, B
Keywords: Parallel combination
Particle degeneracy
Particle filter
Issue Date: 2011
Source: Journal of computational information systems, 2011, v. 7, no. 6, p. 1838-1845 How to cite?
Journal: Journal of Computational Information Systems 
Abstract: Resampling in the particle filter algorithm can solve the algorithm's degeneracy problem. In order to decrease the execution time of the particle filter, the parallel resampling particle filter algorithm is proposed. In the algorithm, firstly all weights of the particles are sorted according to the ascending order. Secondly the particles space is classified into two independent sets. Finally the particles that will be resampled from two sets respectively are found parallelly according to the random search method. According to the theoretical analysis and the experiment results, the algorithm can reduce the search space for resampling and can shorten the search time, so it has high efficiency in the implementation. What is more, the algorithm can overcome the blindness of resampling, and can better embody the basic idea of resampling which is a good weight particle to be reproduced more, so it has better filter and estimation performance.
ISSN: 1553-9105
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Nov 13, 2018

Page view(s)

Last Week
Last month
Citations as of Nov 11, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.