A Genetic Optimization Resampling Based Particle Filtering Algorithm for Indoor Target Tracking

In indoor target tracking based on wireless sensor networks, the particle filtering algorithm has been widely used because of its outstanding performance in coping with highly non-linear problems. Resampling is generally required to address the inherent particle degeneracy problem in the particle filter. However, traditional resampling methods cause the problem of particle impoverishment. This problem degrades positioning accuracy and robustness and sometimes may even result in filtering divergence and tracking failure. In order to mitigate the particle impoverishment and improve positioning accuracy, this paper proposes an improved genetic optimization based resampling method. This resampling method optimizes the distribution of resampled particles by the five operators, i.e., selection, roughening, classification, crossover, and mutation. The proposed resampling method is then integrated into the particle filtering framework to form a genetic optimization resampling based particle filtering (GORPF) algorithm. The performance of the GORPF algorithm is tested by a one-dimensional tracking simulation and a three-dimensional indoor tracking experiment. Both test results show that with the aid of the proposed resampling method, the GORPF has better robustness against particle impoverishment and achieves better positioning accuracy than several existing target tracking algorithms. Moreover, the GORPF algorithm owns an affordable computation load for real-time applications.

Immune Evolution Particle Filter for Soil Moisture Data Assimilation

Data assimilation (DA) has been widely used in land surface models (LSM) to improve model state estimates. Among various DA methods, the particle filter (PF) with Markov chain Monte Carlo (MCMC) has become increasingly popular for estimating the states of the nonlinear and non-Gaussian LSMs. However, the standard PF always suffers from the particle impoverishment problem, characterized by loss of particle diversity. To solve this problem, an immune evolution particle filter with MCMC simulation inspired by the biological immune system, entitled IEPFM, is proposed for DA in this paper. The merit of this approach is in imitating the antibody diversity preservation mechanism to further improve particle diversity, thus increasing the accuracy of estimates. Furthermore, the immune memory function refers to promise particle evolution process towards optimal estimates. Effectiveness of the proposed approach is demonstrated by the numerical simulation experiment using a highly nonlinear atmospheric model. Finally, IEPFM is applied to a soil moisture (SM) assimilation experiment, which assimilates in situ observations into the Variable Infiltration Capacity (VIC) model to estimate SM in the MaQu network region of the Tibetan Plateau. Both synthetic and real case experiments demonstrate that IEPFM mitigates particle impoverishment and provides more accurate assimilation results compared with other popular DA algorithms.

An INS/Floor-Plan Indoor Localization System Using the Firefly Particle Filter

Location-based services for smartphones are becoming more and more popular. The core of location-based services is how to estimate a user’s location. An INS/floor-plan indoor localization system, using the Firefly Particle Filter (FPF), is proposed to estimate a user’s location. INS includes an attitude angle module, a step length module and a step counting module. In the step length module, we propose a hybrid step length model. The proposed step length algorithm reasonably calculates a user’s step length. Because of sensor deviation, non-orthogonality and the user’s jitter, the main bottleneck for INS is that the error grows over time. To reduce the cumulative error, we design cascade filters including the Kalman Filter (KF) and FPF. To a certain extent, KF reduces velocity error and heading drift. On the other hand, the firefly algorithm is used to solve the particle impoverishment problem. Considering that a user may not cross an obstacle, the proposed particle filter is proposed to improve positioning performance. Results show that the average positioning error in walking experiments is 2.14 m.

A Novel Sequential Monte Carlo-Probability Hypothesis Density Filter for Particle Impoverishment Problem

As a typical implementation of the probability hypothesis density (PHD) filter, sequential Monte Carlo PHD (SMC-PHD) is widely employed in highly nonlinear systems. However, diversity loss of particles introduced by the resampling step, which can be called particle impoverishment problem, may lead to performance degradation and restrain the use of SMC-PHD filter in practical applications. In this paper, a novel SMC-PHD filter based on particle compensation is proposed to solve the problem. Firstly, based on an analysis of the particle impoverishment problem, a new particle compensatory method is developed to improve the particle diversity. Then, all the particles are integrated into the SMC-PHD filter framework. Compared with the SMC-PHD filter, simulation results demonstrate that the proposed particle compensatory SMC-PHD filter is capable of overcoming the particle impoverishment problem, which indicate good application prospects.

Corrected Differential Evolution Particle Filter for Nonlinear Filtering

Particle filter is the most successful nonlinear filter for nonlinear filtering. However its resampling process has the critical problem existing is the particle impoverishment problem. In this letter, we propose a new corrected differential evolution particle filter for solving this problem. In this algorithm, the particles sampling from the importance distribution are regarded as the initial population of the Corrected Differential Evolution (CDE) algorithm, and the corresponding weights as the fitness functions. The optimal particles are obtained by the process of the CDE algorithm. Experiment results indicate that the proposed method relieves the particle degeneracy and impoverishment and improves the estimation precision.

Distributed SLAM Using Improved Particle Filter for Mobile Robot Localization

The distributed SLAM system has a similar estimation performance and requires only one-fifth of the computation time compared with centralized particle filter. However, particle impoverishment is inevitably because of the random particles prediction and resampling applied in generic particle filter, especially in SLAM problem that involves a large number of dimensions. In this paper, particle filter use in distributed SLAM was improved in two aspects. First, we improved the important function of the local filters in particle filter. The adaptive values were used to replace a set of constants in the computational process of importance function, which improved the robustness of the particle filter. Second, an information fusion method was proposed by mixing the innovation method and the number of effective particles method, which combined the advantages of these two methods. And this paper extends the previously known convergence results for particle filter to prove that improved particle filter converges to the optimal filter in mean square as the number of particles goes to infinity. The experiment results show that the proposed algorithm improved the virtue of the DPF-SLAM system in isolate faults and enabled the system to have a better tolerance and robustness.

An Optimized Particle Filter for Signal De-Noising Processing

The traditional particle filter (PF) algorithm is well known for signal noise reduction processing, but it exists problems of particle impoverishment and cumulation of estimation errors. An optimized PF algorithm called RBF-PF is proposed in this paper, which uses radial basis function network for training and optimizing the process of particle filter in the sampling. Experimental analysis verifies that the new method used to gain the signal-to-noise ratio is better than traditional PF algorithm during dealing with the added noise signal.