Indoor localization algorithm based on hybrid annealing particle swarm optimization

摘要

Aiming at disadvantages of particle swarm optimization algorithm being easily caught into local extreme point, slow convergence rate of evolution near extreme point, worse precision and others during positioning process, this paper proposes a hybrid annealing particle swarm optimization localization algorithm based on simulated annealing particle swarm algorithm, the idea of “survival of the fittest” is incorporated in the algorithm and the particles with poorer fitness are eliminated according to the Metropolis criterion. At the same time, a minimum positioning error weighting model is proposed to reduce the non-line-of-sight error of anchor nodes during positioning. Simulation and experiment results for several current hybrid particle swarm localization algorithm show that, the localization algorithm can improved the average precision of location and speed up convergence rate.