2012
DOI: 10.1007/s10015-012-0051-3
|View full text |Cite
|
Sign up to set email alerts
|

A faster path planner using accelerated particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 24 publications
(9 citation statements)
references
References 10 publications
0
9
0
Order By: Relevance
“…Karimi using the time scale to determine when a robot moves along the given reference trajectory [11]. In order to solve the problem of robot location and movement, Mohamed et al proposed accelerated PSO to plan a robot's path [12]. Besides, in [13], a new environment model called the danger degree map is constructed.…”
Section: IImentioning
confidence: 99%
“…Karimi using the time scale to determine when a robot moves along the given reference trajectory [11]. In order to solve the problem of robot location and movement, Mohamed et al proposed accelerated PSO to plan a robot's path [12]. Besides, in [13], a new environment model called the danger degree map is constructed.…”
Section: IImentioning
confidence: 99%
“…[18] at Cambridge University in 2007 in order to accelerate the convergence of the algorithm is to use the global best only. PSO and APSO-based optimizations have already been studied by the researchers for optimal design of substation grounding grid [34], performance analysis of MIMO radar waveform [35], design of frame structures [36], dual channel speech enhancement [37] and a faster path planner [38] etc.…”
Section: A Particle Swarm Optimization (Pso)mentioning
confidence: 99%
“…The standard PSO method, originally proposed by Kennedy and Eberhart in [20] and later refined by Shi and Eberhart in [21], [22], has been applied in several scientific fields, such as in optimization analysis, computational intelligence, and scheduling applications. More than thirty PSO variants have been proposed so far to achieve accelerated results, just to mention [24], [25]. However, existing algorithms neglect the acceleration factor of the particles in the swarm, whereas they adopt the term "accelerated" to characterize their convergence rate.…”
Section: Introductionmentioning
confidence: 99%