点对点运动索驱动并联机器人关节空间最短路径的确定

Utkarsh Aashu Mishra, Ishan Chawla, P. Pathak
{"title":"点对点运动索驱动并联机器人关节空间最短路径的确定","authors":"Utkarsh Aashu Mishra, Ishan Chawla, P. Pathak","doi":"10.1109/MED48518.2020.9183198","DOIUrl":null,"url":null,"abstract":"This paper presents a methodology to determine the shortest path in the joint space of a cable-driven parallel robot for point-to-point motions. The formulation is based on the joint space domain i.e., cable length and the shortest path in joint space is determined between the two points. The path is constrained by the 4th degree polynomial in the Cartesian space and the objective function representing the total path length in the joint space is formulated. The parameters of the path are obtained by minimizing the objective function using genetic algorithm while satisfying the non-negative cable tension constraints. The proposed methodology is validated using a 3-DOF planar and a 6-DOF spatial cable-driven robot. The obtained optimized shortest path is compared to a straight-line path and the results obtained shows a significant reduction in the joint space path length of a cable-driven parallel robot for the optimized path. The reduction will be even more significant for the large-scale cable-driven parallel robot.","PeriodicalId":418518,"journal":{"name":"2020 28th Mediterranean Conference on Control and Automation (MED)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On Determining Shortest Path in Joint Space of a Cable-Driven Parallel Robot for Point-to-Point Motion\",\"authors\":\"Utkarsh Aashu Mishra, Ishan Chawla, P. Pathak\",\"doi\":\"10.1109/MED48518.2020.9183198\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a methodology to determine the shortest path in the joint space of a cable-driven parallel robot for point-to-point motions. The formulation is based on the joint space domain i.e., cable length and the shortest path in joint space is determined between the two points. The path is constrained by the 4th degree polynomial in the Cartesian space and the objective function representing the total path length in the joint space is formulated. The parameters of the path are obtained by minimizing the objective function using genetic algorithm while satisfying the non-negative cable tension constraints. The proposed methodology is validated using a 3-DOF planar and a 6-DOF spatial cable-driven robot. The obtained optimized shortest path is compared to a straight-line path and the results obtained shows a significant reduction in the joint space path length of a cable-driven parallel robot for the optimized path. The reduction will be even more significant for the large-scale cable-driven parallel robot.\",\"PeriodicalId\":418518,\"journal\":{\"name\":\"2020 28th Mediterranean Conference on Control and Automation (MED)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 28th Mediterranean Conference on Control and Automation (MED)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MED48518.2020.9183198\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 28th Mediterranean Conference on Control and Automation (MED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MED48518.2020.9183198","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

提出了一种确定点对点运动的缆索驱动并联机器人关节空间最短路径的方法。该公式基于关节空间域,即索长度,并确定两点之间关节空间中的最短路径。该路径在笛卡尔空间中受四次多项式约束,并给出了表示关节空间中路径总长度的目标函数。在满足非负索张力约束条件下,利用遗传算法对目标函数进行最小化,得到路径参数。采用3-DOF平面和6-DOF空间缆索驱动机器人验证了所提出的方法。将优化后的最短路径与直线路径进行比较,结果表明,优化后的路径显著减小了索驱动并联机器人的关节空间路径长度。对于大型缆索驱动的并联机器人,这种减少将更加显著。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Determining Shortest Path in Joint Space of a Cable-Driven Parallel Robot for Point-to-Point Motion
This paper presents a methodology to determine the shortest path in the joint space of a cable-driven parallel robot for point-to-point motions. The formulation is based on the joint space domain i.e., cable length and the shortest path in joint space is determined between the two points. The path is constrained by the 4th degree polynomial in the Cartesian space and the objective function representing the total path length in the joint space is formulated. The parameters of the path are obtained by minimizing the objective function using genetic algorithm while satisfying the non-negative cable tension constraints. The proposed methodology is validated using a 3-DOF planar and a 6-DOF spatial cable-driven robot. The obtained optimized shortest path is compared to a straight-line path and the results obtained shows a significant reduction in the joint space path length of a cable-driven parallel robot for the optimized path. The reduction will be even more significant for the large-scale cable-driven parallel robot.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信