基于混沌变异粒子群算法的工业机器人轨迹规划OA
Trajectory planning of industrial robots based on chaotic mutation particle swarm optimization algorithm
针对在工业制造领域中机器人的运动多约束问题,提出一种基于混沌变异粒子群算法的机器人多约束下运动参数最优的轨迹规划方法.在粒子群算法基础上,采用Logistic混沌映射策略与动态反向学习策略相结合的初始化方法,引入K-邻域模型的精英构造策略和改进的轮盘赌策略,兼顾局部与全局的空间搜索,并引入动态变异邻域搜索策略,以增加种群多样性,提高跳出局部最优解的可能性.通过基准函数寻优测试,并与其他算法性能对比,结果证明该算法具备高质量求解优势.在工业机器人基于五次多项式插值法的轨迹规划应用中,相较于粒子群以及现有改进算法,在满足工作时间约束和运动速度约束条件下,该算法能够有效降低机器人各关节加速度变化幅度,大幅提高机器人运动稳定性.
To address the problem of multi-constraint motion in robots within industrial production,a trajectory planning method based on the chaotic mutation particle swarm optimization algorithm was proposed to optimize motion parameters under multiple constraints.The particle swarm optimization algorithm was enhanced by adopting an initialization method that integrated Logistic chaotic mapping with dynamic reverse learning.The elite construction strategy of the K-neighborhood model and an improved rou-lette strategy were introduced,considering both local and global spatial search.A dynamic mutation neighborhood search strategy was employed to increase population diversity and improve the likelihood of escaping local optima.Benchmark function optimiza-tion tests and performance comparisons with other algorithms demonstrated that the proposed method offered high-quality solutions.In the application of trajectory planning for industrial robots using quintic polynomial interpolation,the method was found to effectively reduce acceleration variations in each robot joint,while satisfying constraints on working time and motion speed,thus significantly improving the robot's motion stability compared to the traditional particle swarm and existing improved algorithms.
杨骏泽;孙丹枫;赵建勇
杭州电子科技大学工业互联网研究院,杭州 310000杭州电子科技大学工业互联网研究院,杭州 310000杭州电子科技大学工业互联网研究院,杭州 310000
信息技术与安全科学
工业机器人多约束混沌变异粒子群算法轨迹规划
industrial robotmultiple constraintschaotic mutation particle swarm optimization algorithmtrajectory planning
《现代制造工程》 2026 (3)
20-28,9
国家自然科学基金重点项目(U21A20484)
评论