稳健性(进化)
弹道
控制理论(社会学)
混蛋
数学优化
局部最优
非线性系统
计算机科学
人口
机器人
趋同(经济学)
运动规划
算法
工程类
轨迹优化
机械臂
局部搜索(优化)
自适应算法
收敛速度
粒子群优化
数学
运动学
搜索算法
最优化问题
人工智能
自适应控制
算法设计
作者
Chen Lifeng,Mao Jiaxin,Xiao Zhao,Tao Jie,Ren Xianling,Zhao Yingjun
标识
DOI:10.1177/16878132251375144
摘要
To address issues of local optimization, slow convergence, and poor accuracy, this work introduces a time-optimal trajectory planning method using the Adaptive Gold Search algorithm (AGS). The method enhances algorithm diversity and escapes local optima through elite reverse strategy population initialization. It employs an adaptive nonlinear decreasing factor for a balance between linearity and nonlinearity, improving accuracy and convergence speed. The golden sinusoidal variation technique enhances global search capabilities and robustness in robot arm trajectory planning. Experimental results show that the AGS algorithm produces smooth joint angular displacement, acceleration, velocity, and jerk curves. It outperforms the GA, PSO, GOOSE, and GWO algorithms in time optimization by 13.31%, 13.61%, 5.34%, and 4.73%, respectively, effectively reducing trajectory planning time.
科研通智能强力驱动
Strongly Powered by AbleSci AI