2018 Tenth International Conference on Advanced Computational Intelligence (ICACI) 2018
DOI: 10.1109/icaci.2018.8377479
|View full text |Cite
|
Sign up to set email alerts
|

Indoor localization algorithm based on hybrid annealing particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(10 citation statements)
references
References 10 publications
0
10
0
Order By: Relevance
“…If there are not enough data sets for training, it cannot converge to the best local minimum or global minimum. In [21], the authors propose an improved algorithm for hybrid annealing particle swarm optimization (HAPSO). The proposed method improved the convergence speed and accuracy of PSO based on the annealing mechanism.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…If there are not enough data sets for training, it cannot converge to the best local minimum or global minimum. In [21], the authors propose an improved algorithm for hybrid annealing particle swarm optimization (HAPSO). The proposed method improved the convergence speed and accuracy of PSO based on the annealing mechanism.…”
Section: Related Workmentioning
confidence: 99%
“…The PSO, which is then performed in a limited region, is an intelligent evolutionary computation algorithm that uses intelligent particles to find the optimal location of the user. The PSO has many advantages, such as high location accuracy, few parameters, and simple implementation [21,28]. During the search, all particles within the cluster share their optimal position.…”
Section: Proposed Indoor Positioningmentioning
confidence: 99%
“…However, there are some inherent problems needed to be addressed when the original PSO algorithm is used in indoor VLP systems, such as premature convergence and low convergence accuracy. Aiming at the above problems of the original PSO algorithm, a hybrid annealing PSO algorithm was proposed in [18] to improve the average positioning accuracy and accelerate the convergence speed. In [19] and [20], trilateral localization was used to reduce the number of iterations and improve the localization accuracy by limiting the generation area.…”
Section: Introductionmentioning
confidence: 99%
“…iii. The proposed IPSO-Min-Max algorithm is compared with the existing PSO [17] and its improved versions [18]- [20] in positioning accuracy and real-time performance to demonstrate the effectiveness of our algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…This makes the PSO inefficient for a global solution; however, local search time is reduced by increasing the inertia weight [16]. On the other hand, Simulated Annealing (SA) is inspired from the natural process of annealing in metallurgy in which after a long cooling period the system always converges to global optima [17]. Hence, PSO suffers from the instability of particles during global convergence and SA jumps to the convergence of global optima.…”
mentioning
confidence: 99%