基于多种群竞争松鼠搜索算法的机械臂时间最优轨迹规划

Time-optimal trajectory planning of manipulator based on multi-group competition squirrel search algorithm

针对传统智能优化算法在机械臂关节空间进行时间最优轨迹规划应用中存在的寻优效率低、优化结果全局性和稳定性差的问题,提出新的机械臂时间最优轨迹规划方法.在建立机械臂关节空间内的时间最优轨迹规划模型时考虑位置约束,根据输入的关节点列,使用S形曲线估算时间的取值区间,对生成算法的所有个体进行多种群竞争迭代,得出机械臂关节空间轨迹规划的时间最优解.与不同算法的仿真对比试验结果表明,所提方法较传统的优化算法具有更高的寻优效率和更好的优化全局性;所提方法的稳定性好,其多次优化结果的方差相较单种群算法低3个数量级.

Aiming at the problems of low optimization efficiency,poor global and stability of optimization results in the application of traditional intelligent optimization algorithms to time-optimal trajectory planning of manipulator in the joint space,a new time-optimal trajectory planning method for manipulator was proposed.The position constraints were considered when the time-optimal trajectory planning model in the joint space of the manipulator was established.According to the input joint point sequence,an S-shaped curve was used to estimate the time interval,and all the individuals in the algorithm were generated to perform multi-group competition iterations.After that,the time-optimal solution of trajectory planning of manipulator in the joint space was obtained.Results of simulation comparison experiments with different algorithms show that the proposed method has higher optimization efficiency and better global optimization than the traditional optimization algorithms.Also,the proposed method has good stability.The variance of its multiple optimization results can be 3 orders of magnitude lower than that of the single population algorithm.