Time optimal trajectory planning of five degrees of freedom manipulator based on PSO algorithm

Zhengshuai Jiang, Qizhi Zhang
{"title":"Time optimal trajectory planning of five degrees of freedom manipulator based on PSO algorithm","authors":"Zhengshuai Jiang, Qizhi Zhang","doi":"10.1109/ICMSP55950.2022.9858972","DOIUrl":null,"url":null,"abstract":"According to the kinematic constraints of the manipulator, a time-optimized 3-5-3 polynomial interpolation algorithm based on particle swarm optimization in joint space is proposed, which solves the shortcomings of polynomial interpolation trajectory planning with high order and no convex hull. Particle swarm optimization is simple in structure, easy to implement, and easy to adjust parameters. It directly selects the polynomial interpolation time as a variable, searches in the target space, and obtains the shortest interpolation time under the specified speed constraint. The simulation is carried out on the experimental platform, and compared with the traditional 3-5-3 polynomial interpolation of position, velocity and acceleration curves, it is proved that the method can achieve shorter running time and better stability of the manipulator.","PeriodicalId":114259,"journal":{"name":"2022 4th International Conference on Intelligent Control, Measurement and Signal Processing (ICMSP)","volume":"105 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 4th International Conference on Intelligent Control, Measurement and Signal Processing (ICMSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMSP55950.2022.9858972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

According to the kinematic constraints of the manipulator, a time-optimized 3-5-3 polynomial interpolation algorithm based on particle swarm optimization in joint space is proposed, which solves the shortcomings of polynomial interpolation trajectory planning with high order and no convex hull. Particle swarm optimization is simple in structure, easy to implement, and easy to adjust parameters. It directly selects the polynomial interpolation time as a variable, searches in the target space, and obtains the shortest interpolation time under the specified speed constraint. The simulation is carried out on the experimental platform, and compared with the traditional 3-5-3 polynomial interpolation of position, velocity and acceleration curves, it is proved that the method can achieve shorter running time and better stability of the manipulator.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于粒子群算法的五自由度机械臂时间最优轨迹规划
根据机械臂的运动约束,提出了一种基于粒子群优化的关节空间时间优化3-5-3多项式插补算法,解决了多项式插补轨迹规划高阶且无凸包的缺点。粒子群算法具有结构简单、易于实现、参数易于调整等特点。它直接选择多项式插补时间作为变量,在目标空间中搜索,得到在指定速度约束下最短的插补时间。在实验平台上进行了仿真,并与传统的3-5-3多项式位置、速度和加速度曲线插补方法进行了比较,证明了该方法可以实现更短的机械手运行时间和更好的稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research and Circuit Design of Dynamic Path Accumulation CMOS Image Sensor An Improved Slap Swarm Algorithm Incorporating Tent Chaotic Mapping and Decay Factor Monitoring method for abrasive jet cutting depth of casing pipes Numerical Simulation Research on Dual-frequency Processing of Oil-based Mud Electrical Imaging Logging Development of an environmentally friendly electricity monitoring platform
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1