Research on Robot Path Planning Based on Improved Genetic Algorithm
Qingsong Bi, Jinxiang Pian, Fenghua Wu, Yingxu Dai
- 发表年份
- 2022
- 引用次数
- 2
摘要
Aiming at the disadvantages of genetic algorithm in robot path planning, such as blindness and randomness of initial population, too many path turning points and easy to fall into local optimization, an improved genetic algorithm is proposed. The prior knowledge is used to initialize the path in the direction of the target point, and the continuous and obstruction-free collision path is further obtained to enhance convergence rate. A new fitness function is designed combining the path length and the number of turning points to improve the efficiency of path planning. Simulation results show that compared with the traditional genetic algorithm, the shortest path of the improved genetic algorithm can be shortened by 9.97%, and it is better than the traditional genetic algorithm in convergence rate and the number of turning points.
关键词
相关论文
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