Indoor Fingerprint Positioning Method with Standard Particle Swarm Optimization

2021 ◽  
pp. 403-412
Author(s):  
Jingxue Bi ◽  
Hongji Cao ◽  
Guobiao Yao ◽  
Zhe Chen ◽  
Jingchun Cao ◽  
...  
2011 ◽  
Vol 383-390 ◽  
pp. 5744-5750
Author(s):  
Xi Zhen Wang ◽  
Yan Li ◽  
Gang Hu Cheng

A PSO Algorithm with Team Spirit Inertia weight (TSWPSO) is presented based on the study of the effect of inertia weight on Standard Particle Swarm Optimization (SPSO). Due to the theory of group in organization psychology, swarm is divided into multiple sub-swarms and search is run in a number of different sub-swarms which are parallel performed. Try to find or modify a curve which is compatible with optimized object within many inertia weight decline curves, in order to balance the global and local explorations ability in particle swarm optimization and to avoid the premature convergence problem effectively. The testes by five classical functions show that, TSWPSO has a better performance in both the convergence rate and the precision.


2011 ◽  
Vol 383-390 ◽  
pp. 7208-7213
Author(s):  
De Kun Tan

To overcome the shortage of standard Particle Swarm Optimization(SPSO) on premature convergence, Quantum-behaved Particle Swarm Optimization (QPSO) is presented to solve engineering constrained optimization problem. QPSO algorithm is a novel PSO algorithm model in terms of quantum mechanics. The model is based on Delta potential, and we think the particle has the behavior of quanta. Because the particle doesn’t have a certain trajectory, it has more randomicity than the particle which has fixed path in PSO, thus the QPSO more easily escapes from local optima, and has more capability to seek the global optimal solution. In the period of iterative optimization, outside point method is used to deal with those particles that violate the constraints. Furthermore, compared with other intelligent algorithms, the QPSO is verified by two instances of engineering constrained optimization, experimental results indicate that the algorithm performs better in terms of accuracy and robustness.


2013 ◽  
Vol 631-632 ◽  
pp. 1324-1329
Author(s):  
Shao Rong Huang

To improve the performance of standard particle swarm optimization algorithm that is easily trapped in local optimum, based on analyzing and comparing with all kinds of algorithm parameter settings strategy, this paper proposed a novel particle swarm optimization algorithm which the inertia weight (ω) and acceleration coefficients (c1 and c2) are generated as random numbers within a certain range in each iteration process. The experimental results show that the new method is valid with a high precision and a fast convergence rate.


2012 ◽  
Vol 468-471 ◽  
pp. 2550-2553
Author(s):  
Ri Su Na ◽  
Qiang Li ◽  
Li Ji Wu

Based on the standard particle swarm optimization, introduce the information about negative gradient to influence the update of velocities of the particles, proposed the particles swarm optimization with negative gradient , and make the movement of particles more pertinent. The result of computer simulation about several test functions indicates that the particle swarm optimization with negative gradient can improve optimization efficiency and get better results.


Sign in / Sign up

Export Citation Format

Share Document