Ant Colony Algorithm Based on Upper Bound of Nodes for Robot Path Planning Problems

Qiu, Sizhi; Hu, Bo; Quan, Yongbin; Jian, Xiaoxin; Ouyang, Haibin

doi:10.1007/978-981-15-3425-6_8

Cited by 1 publication

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Inspired optimization algorithms have been used in a variety of fields (such as image detection [5][6][7], image segmentation [8,9], parameter optimization [10][11][12][13], PID control [8,14], feature selection [15], scheduling problem [16,17], K-means (KM) [18,19], and clustering [20,21]). e improved PSO algorithms are also used in classification, such as adaptive particle swarm optimization for parameter optimization in classification models [22] and multiobjective particle swarm optimization approach for feature selection in classification [23].…”

Section: Introductionmentioning

confidence: 99%

Improvement and Application of Fractional Particle Swarm Optimization Algorithm

Zhao

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The convergence performance of existing fractional particle swarm optimization algorithm directly depends on a single fractional-order operator. When its value increases, the convergence speed of particles gets slower. When its value decreases, the probability of the particle swarm trapping into the local optimum increases. In order to solve this problem, an improved fractional particle swarm optimization (IFPSO) algorithm is proposed in this paper. New variables are introduced in this paper to redefine the formula. The fractional-order operator is added to the velocity update formula and the position update formula. The IFPSO algorithm has linearly decreasing inertia weights. Then the proposed IFPSO algorithm is used to optimize the parameters of support vector machine (SVM) and the clustering center of the K-means classifier is selected. Experimental results show that the IFPSO algorithm can effectively avoid falling into the local optimal solution. It has a faster convergence rate and better stability than the original algorithm, which proves the effectiveness of the algorithm. Examples verify that the IFPSO algorithm can improve the classification accuracy of SVM in practical application. The IFPSO algorithm effectively solves the problem that K-means algorithm is overly dependent on the initial center and may have empty classes.

show abstract

Section: Introductionmentioning

confidence: 99%

Improvement and Application of Fractional Particle Swarm Optimization Algorithm

Zhao

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

Ant Colony Algorithm Based on Upper Bound of Nodes for Robot Path Planning Problems

Cited by 1 publication

References 8 publications

Improvement and Application of Fractional Particle Swarm Optimization Algorithm

Improvement and Application of Fractional Particle Swarm Optimization Algorithm

Contact Info

Product

Resources

About