现代制造工程Issue(3)：20-28,9.DOI:10.16731/j.cnki.1671-3133.2026.03.003
基于混沌变异粒子群算法的工业机器人轨迹规划
Trajectory planning of industrial robots based on chaotic mutation particle swarm optimization algorithm
摘要
Abstract
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.关键词
工业机器人/多约束/混沌变异粒子群算法/轨迹规划Key words
industrial robot/multiple constraints/chaotic mutation particle swarm optimization algorithm/trajectory planning分类
信息技术与安全科学引用本文复制引用
杨骏泽,孙丹枫,赵建勇..基于混沌变异粒子群算法的工业机器人轨迹规划[J].现代制造工程,2026,(3):20-28,9.基金项目
国家自然科学基金重点项目(U21A20484) （U21A20484）
