Optimal Trajectory Planning under Kino-dynamics Constraints for a 6-DOF PUMA 560

Nadir Bendali, M. Ouali, Kamel Ghellal
{"title":"Optimal Trajectory Planning under Kino-dynamics Constraints for a 6-DOF PUMA 560","authors":"Nadir Bendali, M. Ouali, Kamel Ghellal","doi":"10.1145/2832987.2833049","DOIUrl":null,"url":null,"abstract":"We present in this paper an effective method to deal with the problem of the trajectories planning in time-efforts quadratic optimal of the robots manipulators in the point to point tasks. The technique suggested in this work, consists at the beginning to standardizing the time scale then to break up the trajectory into two functions which are modelled by Cubic Splines (Natural and Clamped) according to the properties of each function. Finally, the problem of optimization is solved by using the Genetic Algorithms to find the optimal trajectory. An algorithm is developed which makes it possible to minimize a function objective which represents a weighting between the transfer time and the efforts of the actuators, with the satisfaction of the geometrical, kinematics and dynamic constraints. Results on a robot PUMA560 6R are presented to illustrate the effectiveness of this technique.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"22 11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the The International Conference on Engineering & MIS 2015","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2832987.2833049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We present in this paper an effective method to deal with the problem of the trajectories planning in time-efforts quadratic optimal of the robots manipulators in the point to point tasks. The technique suggested in this work, consists at the beginning to standardizing the time scale then to break up the trajectory into two functions which are modelled by Cubic Splines (Natural and Clamped) according to the properties of each function. Finally, the problem of optimization is solved by using the Genetic Algorithms to find the optimal trajectory. An algorithm is developed which makes it possible to minimize a function objective which represents a weighting between the transfer time and the efforts of the actuators, with the satisfaction of the geometrical, kinematics and dynamic constraints. Results on a robot PUMA560 6R are presented to illustrate the effectiveness of this technique.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于kino动力学约束的6自由度PUMA 560最优轨迹规划
本文提出了一种有效的方法来解决点到点任务中机器人操作手的时间-精力二次最优轨迹规划问题。本文提出的方法是首先标准化时间尺度,然后根据每个函数的性质将轨迹分解为两个函数,分别用三次样条(自然样条和箝位样条)建模。最后,利用遗传算法寻找最优轨迹,解决了优化问题。在满足几何、运动学和动力学约束的情况下,开发了一种算法,使传递时间和执行器努力之间的权重函数目标最小化。以puma5606r机器人为例,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Hybrid Discrete Flower Pollination Algorithm for Graph Coloring Problem QoS web service Security Access Control case study using HTTP Secured Socket Layer Approach An improved k-Means Clustering algorithm for Intrusion Detection using Gaussian function A Feature Vector Based Approach for Software Component Clustering and Reuse Using K-means A Proposed Method to Recognize the Research Trends using Web-based Search Engines
×
引用
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