Particle filter algorithm based on geometric center and likelihood estimation
Affiliation
Department of Management Information Systems, University of ArizonaIssue Date
2021
Metadata
Show full item recordPublisher
American Institute of Physics Inc.Citation
Fang, X., Luo, Y., Wang, L., Jiang, S., Xu, N., & Zeng, D. D. (2021). Particle filter algorithm based on geometric center and likelihood estimation. AIP Advances, 11(8).Journal
AIP AdvancesRights
Copyright © 2021 Author(s). All article content, except where otherwise noted, is licensed under a Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).Collection Information
This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.Abstract
The improved particle filter (PF) based on the geometric center and likelihood estimation is proposed in order to solve the problem of particle dilution and degradation. In the resampling stage, the geometric center is used to resample the particles. The particles are filtered according to the distance between the particles and the geometric center, and then the particles are resampled. The resampled particles are composed of newborn particles and non-resampled particles. The former can help alleviate the degradation problem, while the latter can keep the diversity of the particle set. In order to ensure effectiveness of the PF, the positioning error threshold of the particle filter is introduced. In the phase of particle weighting calculation, in view of the problem of low accuracy and divergence of PF state estimation caused by non-stationary and non-Gaussian noise, it adopts non-Gaussian noise parameter estimation based on likelihood to approximately estimate the measurement noise instead of the Gaussian density function. The proposed model is applied to particle weight calculation to avoid particle degradation caused by Gaussian density function approximation. The simulation results show that, after the improved algorithm, the root-mean-square error is reduced to 0.085, the variance is reduced to 0.014, and the running time is shortened by 14.8% compared with the polynomial resampling algorithm, which can effectively alleviate particle degradation and dilution in the traditional PF algorithm, and the positioning accuracy is also improved. © 2021 Author(s).Note
Open access articleISSN
2158-3226Version
Final published versionae974a485f413a2113503eed53cd6c53
10.1063/5.0058367
Scopus Count
Collections
Except where otherwise noted, this item's license is described as Copyright © 2021 Author(s). All article content, except where otherwise noted, is licensed under a Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

