2014
DOI: 10.48550/arxiv.1401.0546
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Low-Complexity Particle Swarm Optimization for Time-Critical Applications

Abstract: Particle swam optimization (PSO) is a popular stochastic optimization method that has found wide applications in diverse fields. However, PSO suffers from high computational complexity and slow convergence speed. High computational complexity hinders its use in applications that have limited power resources while slow convergence speed makes it unsuitable for time critical applications. In this paper, we propose two techniques to overcome these limitations. The first technique reduces the computational complex… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 43 publications
(67 reference statements)
0
4
0
Order By: Relevance
“…Remark 1. Although particle swarm optimization is a popular stochastic optimization method, it may not always provide low-complexity routing algorithms [45,46]. Authors in [47] compared the performance of the particle swarm optimization and differential evolution techniques to find delivery routings with minimum travel distances with quadratic complexity in time and space.…”
Section: Complexity Of the Auas Swarm Routing Algorithmmentioning
confidence: 99%
“…Remark 1. Although particle swarm optimization is a popular stochastic optimization method, it may not always provide low-complexity routing algorithms [45,46]. Authors in [47] compared the performance of the particle swarm optimization and differential evolution techniques to find delivery routings with minimum travel distances with quadratic complexity in time and space.…”
Section: Complexity Of the Auas Swarm Routing Algorithmmentioning
confidence: 99%
“…We recall here that particle swarm optimization has gained more attention as a stochastic optimization technique to route drone swarms. However, it does not consistently yield routing algorithms with low complexity [1,20,62]. On the other hand, the paper [63] shows the performance comparisons of particle swarm optimization and differential evolution techniques while identifying delivery routes, with minimal travel distances having quadratic complexity in both time and space.…”
Section: Arithmetic Complexity Of the Algorithmmentioning
confidence: 99%
“…Remark 1. Since N is fixed after the deployment of the drone swarms, i.e., the number of elements in the antenna array is fixed after the deployments, and followed by the Proposition 2, the RSwarm algorithm has just less than the quadratic complexity, i.e., O(M p ), where p < 2, while comparing with [1,20,[62][63][64][65][66]. Furthermore, the RSwarm algorithm allows one to route a drone swarm with over 100 members, which is an improvement compared to the limitations of the existing AODV-based swarm members [15,59,60].…”
Section: Arithmetic Complexity Of the Algorithmmentioning
confidence: 99%
“…This process continues until a termination condition is met. The number of iterations required for convergence depends on various factors such as the problem complexity, the size of the search space, and the convergence speed of the swarm [ 76 ]. Generally, the time complexity of PSO is considered to be moderate, as it typically requires a reasonable number of iterations to converge to an acceptable solution [ 77 ].…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%