2022
DOI: 10.3390/pr11010026
|View full text |Cite
|
Sign up to set email alerts
|

Path Planning of Mobile Robots Based on an Improved Particle Swarm Optimization Algorithm

Abstract: Aiming at disadvantages of particle swarm optimization in the path planning of mobile robots, such as low convergence accuracy and easy maturity, this paper proposes an improved particle swarm optimization algorithm based on differential evolution. First, the concept of corporate governance is introduced, adding adaptive adjustment weights and acceleration coefficients to improve the traditional particle swarm optimization and increase the algorithm convergence speed. Then, in order to improve the performance … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 40 publications
0
1
0
Order By: Relevance
“…The parameter of inertia weight is very important in PSO. When the value of the inertia weight is large, PSO has better global search ability and faster convergence speed, but the solution is often not optimal; when the value of the inertia weight is small, PSO has better local search ability and can obtain better solutions, but the convergence speed becomes very slow or even stagnant [37]. In order for PSO to produce better solutions, faster convergence speed, stronger global search ability, and stronger local exploitation ability, a linear decreasing adjustment is used for PSO, which can give the algorithm stronger global search ability in the early search and stronger local exploitation ability in the late search, which can expand the search space and make the particle local search for better results.…”
Section: Particle Swarm Algorithm Based On Rankingmentioning
confidence: 99%
“…The parameter of inertia weight is very important in PSO. When the value of the inertia weight is large, PSO has better global search ability and faster convergence speed, but the solution is often not optimal; when the value of the inertia weight is small, PSO has better local search ability and can obtain better solutions, but the convergence speed becomes very slow or even stagnant [37]. In order for PSO to produce better solutions, faster convergence speed, stronger global search ability, and stronger local exploitation ability, a linear decreasing adjustment is used for PSO, which can give the algorithm stronger global search ability in the early search and stronger local exploitation ability in the late search, which can expand the search space and make the particle local search for better results.…”
Section: Particle Swarm Algorithm Based On Rankingmentioning
confidence: 99%
“…It might ultimately discover the suboptimal or optimal approach for an issue over multiple iterations [37]. The enhanced PSO, which is considered an intelligent PSO during this experiment, can be abbreviated in Equations ( 17) and ( 18) using Equations ( 1) and ( 2) [38].…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Optimization problems occur frequently in various practical engineering problems [1]. Thus, it is crucial to solve optimization problems efficiently [2].…”
Section: Introductionmentioning
confidence: 99%