渡线
运动规划
遗传算法
路径(计算)
计算机科学
趋同(经济学)
数学优化
算法
局部最优
机器人
突变
人工智能
数学
生物化学
化学
经济
基因
程序设计语言
经济增长
作者
Yimin Xiao,Mingming Zhao
标识
DOI:10.1109/ic2ecs57645.2022.10087954
摘要
To solve the problems of slow convergence speed and easy to fall into local optimum when adaptive genetic algorithm is applied to robot path planning, an improved adaptive genetic path planning method is proposed. In this method, turning angle evaluation index is introduced to improve the practicability of the path planning objective function; The adaptive adjustment strategy for optimizing the crossover probability and mutation probability, and the disaster operation and reversal operation are added, effectively improving the global optimization ability and convergence speed of path planning. The simulation results show that compared with the traditional adaptive genetic algorithm, this algorithm has stronger global optimization ability, requires fewer iterations, and its path planning performance is better than other improved algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI