检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭北涛[1] 刘磊 张丽秀[2] GUO Beitao;LIU Lei;ZHANG Lixiu(School of Mechanical and Power Engineering,Shenyang University of Chemical Technology,Shenyang 110142,China;School of Transportation and Mechanical Engineering,Shenyang Jianzhu University,Shenyang 110168,China)
机构地区:[1]沈阳化工大学机械与动力工程学院,沈阳110142 [2]沈阳建筑大学交通与机械工程学院,沈阳110168
出 处:《组合机床与自动化加工技术》2024年第9期61-66,共6页Modular Machine Tool & Automatic Manufacturing Technique
基 金:国家自然科学基金项目(51375317);沈阳市科技计划项目(F16-228-6-00)。
摘 要:为解决传统机器人工作效率低、稳定性不足和传统粒子群算法易早熟等问题,提出了一种基于改进粒子群算法的时间最优轨迹规划算法。通过改进粒子群算法的惯性权重和学习因子,优化了粒子群算法的局部和全局搜索能力。首先,以国产ER8型机器人为研究对象,采用改进型D-H参数法获得机器人连杆参数数据,同时通过运动学正逆解理论计算求出了轨迹插值点;其次,利用MATLAB机器人工具箱建立了ER8机器人仿真模型,由于正逆解理论值与仿真结果完全相一致,证明了所建仿真模型的正确性;最后,通过MATLAB仿真得到机器人3-5-3多项式插值构造的轨迹中各关节的位置、速度和加速度等信息,在满足运动学约束的前提下,利用改进粒子群算法优化3-5-3混合多项式插值函数构造的轨迹,机器人用于完成轨迹的时间从3 s减少到1.0375 s,相对于优化前,整体运行时间缩短了大约65%,证明文中改进的粒子群算法可以有效实现时间最优的轨迹规划。In order to improve the problems of low work efficiency,insufficient stability and precocious ripening of traditional particle swarm algorithms,a time-optimal trajectory planning algorithm based on improved particle swarm algorithm is proposed.By improving the inertial weight and learning factors of the particle swarm algorithm,the local and global search capabilities of the particle swarm algorithm are optimized.Firstly,taking the domestic ER8 robot as the research object,uses the improved D-H parameter method to obtain the robot linkage parameter data,and at the same time calculates the trajectory interpolation and point through the kinematic positive and inverse solution theory.Secondly,the ER8 robot simulation model is established by using the MATLAB robot toolbox.Because the theoretical value of the positive and inverse solution is completely consistent with the simulation results,it proves the correctness of the built simulation model.Finally,through MATIAB simulation,information such as the position,speed and acceleration of each joint in the trajectory of the robot′s 3-5-3 polynomial interpolation structure is obtained.Under the premise of meeting the kinematic constraints,the trajectory of the 3-5-3 hybrid polynomial interpolation structure is optimized by using the improved particle swarm algorithm.The robot is used to complete The trajectory time has been reduced from 3 s to 1.0375 s.Compared with before optimization,the overall running time has been shortened by about 65%,which proves that the improved particle swarm algorithm in the article can effectively realize the optimal trajectory planning.
关 键 词:改进D-H法 运动学 多项式插值 改进粒子群算法 轨迹规划
分 类 号:TH165[机械工程—机械制造及自动化] TG659[金属学及工艺—金属切削加工及机床]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7