Trajectory Optimization for a 6 DOF Robotic Arm Based on Reachability Time

Q2 Computer Science
Mahmoud A. A. Mousa, Abdelrahman Elgohr, Hatem A. Khater
{"title":"Trajectory Optimization for a 6 DOF Robotic Arm Based on Reachability Time","authors":"Mahmoud A. A. Mousa, Abdelrahman Elgohr, Hatem A. Khater","doi":"10.33166/aetic.2024.01.003","DOIUrl":null,"url":null,"abstract":"The design of the robotic arm's trajectory is based on inverse kinematics problem solving, with additional refinements of certain criteria. One common design issue is the trajectory optimization of the robotic arm. Due to the difficulty of the work in the past, many of the suggested ways only resulted in a marginal improvement. This paper introduces two approaches to solve the problem of achieving robotic arm trajectory control while maintaining the minimum reachability time. These two approaches are based on rule-based optimization and a genetic algorithm. The way we addressed the problem here is based on the robot’s forward and inverse kinematics and takes into account the minimization of operating time throughout the operation cycle. The proposed techniques were validated, and all recommended criteria were compared on the trajectory optimization of the KUKA KR 4 R600 six-degree-of-freedom robot. As a conclusion, the genetic based algorithm behaves better than the rule-based one in terms of achieving a minimal trip time. We found that solutions generated by the Genetic based algorithm are approximately 3 times faster than the other solutions generated by the rule-based algorithm to the same paths. We argue that as the rule-based algorithm produces its solutions after discovering all the problem’s searching space which is time consuming, and it is not the case as per the genetic based algorithm.","PeriodicalId":36440,"journal":{"name":"Annals of Emerging Technologies in Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Emerging Technologies in Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33166/aetic.2024.01.003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

Abstract

The design of the robotic arm's trajectory is based on inverse kinematics problem solving, with additional refinements of certain criteria. One common design issue is the trajectory optimization of the robotic arm. Due to the difficulty of the work in the past, many of the suggested ways only resulted in a marginal improvement. This paper introduces two approaches to solve the problem of achieving robotic arm trajectory control while maintaining the minimum reachability time. These two approaches are based on rule-based optimization and a genetic algorithm. The way we addressed the problem here is based on the robot’s forward and inverse kinematics and takes into account the minimization of operating time throughout the operation cycle. The proposed techniques were validated, and all recommended criteria were compared on the trajectory optimization of the KUKA KR 4 R600 six-degree-of-freedom robot. As a conclusion, the genetic based algorithm behaves better than the rule-based one in terms of achieving a minimal trip time. We found that solutions generated by the Genetic based algorithm are approximately 3 times faster than the other solutions generated by the rule-based algorithm to the same paths. We argue that as the rule-based algorithm produces its solutions after discovering all the problem’s searching space which is time consuming, and it is not the case as per the genetic based algorithm.
基于可达性时间的 6 DOF 机械臂轨迹优化
机械臂的轨迹设计基于逆运动学问题的解决,并对某些标准进行了额外的改进。一个常见的设计问题是机械臂的轨迹优化。由于过去的工作难度较大,许多建议的方法只能带来微不足道的改进。本文介绍了两种方法来解决实现机械臂轨迹控制,同时保持最短到达时间的问题。这两种方法分别基于规则优化和遗传算法。我们解决该问题的方法基于机器人的正向和反向运动学,并考虑了整个操作周期内操作时间的最小化。在对库卡 KR 4 R600 六自由度机器人进行轨迹优化时,对提出的技术进行了验证,并对所有推荐标准进行了比较。结论是,在实现最短行程时间方面,基于遗传的算法要优于基于规则的算法。我们发现,在相同路径上,基于遗传算法生成的解决方案比基于规则算法生成的其他解决方案快约 3 倍。我们认为,基于规则的算法是在发现问题的所有搜索空间后生成解决方案的,这很耗时,而基于遗传的算法则不然。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Annals of Emerging Technologies in Computing
Annals of Emerging Technologies in Computing Computer Science-Computer Science (all)
CiteScore
3.50
自引率
0.00%
发文量
26
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信