Using ALC-PSO algorithm with particle growing method path planning in dynamic environments
Hung‐Yuan Chung, Yongan Ye, Jyun-Fu Jiang
- Year
- 2014
- Citations
- 2
Abstract
This paper proposes an optimal path planning algorithm for mobile robots based on Particle Swam Optimization with an Aging Leader and Challengers (ALC-PSO) and Rapidly-exploring Random Tree (RRT), it improved algorithm of ALC-PSO to imitate concept of RRT root node grown into goal point in path planning, and add Danger Degree Map to avoid obstacles, this method is not only overcome the drawback for particle swam optimization which is easy to fall into local optimization in robotic path planning and the basic Rapidly-exploring Random Tree path planning in avoiding the premature convergence problem, but also improve both of algorithm which can't plan in dynamic environment. From the results of simulations, we show that this algorithm can improve the stability of RRT path planning in dynamic environment, and ensure that the path is almost optimal.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Fractional Differential Equations
Igor Podlubný
2025
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991