Conference Paper

Evolutionary particle filter: Re-sampling from the genetic algorithm perspective

ARC Centre of Excellence for Autonomous Syst., Univ. of Technol., Sydney, NSW, Australia
DOI: 10.1109/IROS.2005.1545119 Conference: Intelligent Robots and Systems, 2005. (IROS 2005). 2005 IEEE/RSJ International Conference on
Source: IEEE Xplore

ABSTRACT The sample impoverishment problem in particle filters is investigated from the perspective of genetic algorithms. The contribution of this paper is in the proposal of a hybrid technique to mitigate sample impoverishment such that the number of particles required and hence the computation complexities are reduced. Studies are conducted through the use of Chebyshev inequality for the number of particles required. The relationship between the number of particles and the time for impoverishment is examined by considering the takeover phenomena as found in genetic algorithms. It is revealed that the sample impoverishment problem is caused by the resampling scheme in implementing the particle filter with a finite number of particles. The use of uniform or roulette-wheel sampling also contributes to the problem. Crossover operators from genetic algorithms are adopted to tackle the finite particle problem by re-defining or re-supplying impoverished particles during filter iterations. Effectiveness of the proposed approach is demonstrated by simulations for a monobot simultaneous localization and mapping application.

  • [Show abstract] [Hide abstract]
    ABSTRACT: In this study, a novel method is presented for non-linear, non-Gaussian online state and parameter identification, developed for use in structural health monitoring (SHM) problems. The algorithm consists of a particle filter (PF) that combines the use of the standard PF with mutation operators. The algorithm aims at alleviating the sample impoverishment problem, which is a well-known limitation of the standard PF, yielding it inefficient for demanding non-linear identification problems. To overcome this hurdle, we introduce here an alternative approach, influenced by the principles of evolutionary computation. After the standard PF steps are performed to a point where the sample diversity drops below some threshold, the unfit particles are replaced by either the fittest particles or the current weighted estimate of the state. Next, the time-invariant components of the particles are mutated under some mutation probability, and the new sample is then propagated to the next time step. This process is well suited for joint state and parameter estimation problems, as is usually the case in SHM techniques. As a result, the loss of diversity associated with the standard PF is overcome, and the new PF with mutation is shown to outperform the standard PF and the unscented Kalman filter for the case of high process noise. The method is validated through an established benchmark problem found in the literature, lying outside of the structural identification concept, and a previously referenced 3DOF structural system with hysteresis elaborating the SHM aspect. Copyright © 2012 John Wiley & Sons, Ltd.
    Structural Control and Health Monitoring 07/2013; 20(7-7):1081-1095. DOI:10.1002/stc.1520 · 1.73 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: A new approach is proposed for single channel blind signal separation(SCBSS) problem of communication signal and time-varying amplitude LFM interference based on Metropolis-Hastings mutation particle swarm optimized particle filtering (MHMPSOPF). The proposed algorithm aims to obtain the maximum a posterior (MAP) estimate of communication code and the unknown parameters using particle filtering by establishing the state space model for the interfered signal, Specially, in order to overcome the sample impoverishment problem, particle swarm optimized is introduced to the re-sampling process in particle filtering(PF). In such a way, the number of needed particles is reduced and the variety of particles is retained during the sequential estimation process, moreover, the proposed algorithm has superior performance under time-varying amplitude LFM interference. Simulation results show that the method is effective to separate communication signal and interference when the ISR is less than 20dB and SNR is more than 14dB.
    2013 IEEE International Conference on Signal and Image Processing Applications (ICSIPA); 10/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper a novel filtering procedure that uses a variant of the variable neighborhood search (VNS) algorithm for solving nonlinear global optimization problems is presented. The base of the new estimator is a particle filter enhanced by the VNS algorithm in resampling step. The VNS is used to mitigate degeneracy by iteratively moving weighted samples from starting positions into the parts of the state space where peaks and ridges of a posterior distribution are situated. For testing purposes, bearings-only tracking problem is used, with two static observers and two types of targets: non-maneuvering and maneuvering. Through numerous Monte Carlo simulations, we compared performance of the proposed filtering procedure with the performance of several standard estimation algorithms. The simulation results show that the algorithm mostly performed better than the other estimators used for comparison; it is robust and has fast initial convergence rate. Robustness to modeling errors of this filtering procedure is demonstrated through tracking of the maneuvering target. Moreover, in the paper it is shown that it is possible to combine the proposed algorithm with an interacted multiple model framework.
    Computers & Operations Research 12/2014; 52:192–202. DOI:10.1016/j.cor.2013.11.013 · 1.72 Impact Factor

Full-text (2 Sources)

Available from
May 21, 2014