并联机床多准则工作空间优化的新方法

Sheikh Muhammad Muneeb Hamid Rasheed, Adnan Shujah, Sadia Ayub, Aamer Baqai, Kunwar Faraz Ahmad
{"title":"并联机床多准则工作空间优化的新方法","authors":"Sheikh Muhammad Muneeb Hamid Rasheed, Adnan Shujah, Sadia Ayub, Aamer Baqai, Kunwar Faraz Ahmad","doi":"10.1109/ICRAI57502.2023.10089541","DOIUrl":null,"url":null,"abstract":"Parallel kinematic machines (PKM) or parallel robots have been a topic of research for the last two decades. Serial robots, due to their inherent drawbacks (Higher error amplification at the end effector, Greater weight to payload ratio, etc.), cannot be used in applications that require high accuracy across the workspace. Parallel robots overcome these drawbacks, making them a natural replacement for serial robots. However, they also have associated drawbacks (Small irregularly shaped workspace, many singularities in the workspace, etc.). For complex applications, the use of parallel robots instead of serial robots is preferred. For large-scale deployment of parallel manipulators in industries, remedial measures to overcome their drawbacks need to be developed. Most importantly, workspace optimization is required to exploit the full potential of these robots. This optimization is subject to one or more performance parameters (objectives) that often have conflicting requirements i.e. improving one objective deteriorates the performance of another, which is by far a severe challenge in this domain. An example of conflicting goals is “To purchase a car that is cheap, comfortable, safe, environment-friendly, high power and fuel-efficient”. In such cases, “best compromise between conflicting goals” is the best solution. Thus far, workspace optimization of parallel robots focuses on optimization concerning a single objective at a given time. The basic idea of this work is to propose a methodology to optimize the workspace of a PKM subject to multiple objectives simultaneously. Several optimization schemes including weighted averages, gradient descent, surrogate optimization, and genetic algorithms were studied. Pareto front optimization appears to be most suited to the application at hand.","PeriodicalId":447565,"journal":{"name":"2023 International Conference on Robotics and Automation in Industry (ICRAI)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel Approach for Multi-Criteria Workspace Optimization of Parallel Kinematic Machines\",\"authors\":\"Sheikh Muhammad Muneeb Hamid Rasheed, Adnan Shujah, Sadia Ayub, Aamer Baqai, Kunwar Faraz Ahmad\",\"doi\":\"10.1109/ICRAI57502.2023.10089541\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Parallel kinematic machines (PKM) or parallel robots have been a topic of research for the last two decades. Serial robots, due to their inherent drawbacks (Higher error amplification at the end effector, Greater weight to payload ratio, etc.), cannot be used in applications that require high accuracy across the workspace. Parallel robots overcome these drawbacks, making them a natural replacement for serial robots. However, they also have associated drawbacks (Small irregularly shaped workspace, many singularities in the workspace, etc.). For complex applications, the use of parallel robots instead of serial robots is preferred. For large-scale deployment of parallel manipulators in industries, remedial measures to overcome their drawbacks need to be developed. Most importantly, workspace optimization is required to exploit the full potential of these robots. This optimization is subject to one or more performance parameters (objectives) that often have conflicting requirements i.e. improving one objective deteriorates the performance of another, which is by far a severe challenge in this domain. An example of conflicting goals is “To purchase a car that is cheap, comfortable, safe, environment-friendly, high power and fuel-efficient”. In such cases, “best compromise between conflicting goals” is the best solution. Thus far, workspace optimization of parallel robots focuses on optimization concerning a single objective at a given time. The basic idea of this work is to propose a methodology to optimize the workspace of a PKM subject to multiple objectives simultaneously. Several optimization schemes including weighted averages, gradient descent, surrogate optimization, and genetic algorithms were studied. Pareto front optimization appears to be most suited to the application at hand.\",\"PeriodicalId\":447565,\"journal\":{\"name\":\"2023 International Conference on Robotics and Automation in Industry (ICRAI)\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 International Conference on Robotics and Automation in Industry (ICRAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRAI57502.2023.10089541\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Robotics and Automation in Industry (ICRAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRAI57502.2023.10089541","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

并联机器人(PKM)是近二十年来研究的一个课题。串行机器人,由于其固有的缺点(更高的误差放大在末端执行器,更大的重量与有效载荷比等),不能用于需要高精度的工作空间的应用。并联机器人克服了这些缺点,成为串行机器人的自然替代品。然而,它们也有相关的缺点(不规则形状的小工作空间,工作空间中的许多奇异点,等等)。对于复杂的应用,使用并联机器人而不是串行机器人是首选。为了在工业中大规模部署并联机器人,需要制定补救措施来克服其缺点。最重要的是,需要对工作空间进行优化,以充分利用这些机器人的潜力。这种优化受制于一个或多个性能参数(目标),这些参数(目标)通常具有相互冲突的需求,例如,改进一个目标会降低另一个目标的性能,这是该领域迄今为止面临的严峻挑战。目标冲突的一个例子是“买一辆便宜、舒适、安全、环保、大功率和节油的汽车”。在这种情况下,“冲突目标之间的最佳妥协”是最好的解决方案。迄今为止,并联机器人的工作空间优化主要是针对给定时间内单个目标的优化。本工作的基本思想是提出一种方法来优化PKM的工作空间,同时受到多个目标的影响。研究了加权平均、梯度下降、代理优化和遗传算法等优化方案。帕累托前优化似乎最适合手头的应用程序。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Approach for Multi-Criteria Workspace Optimization of Parallel Kinematic Machines
Parallel kinematic machines (PKM) or parallel robots have been a topic of research for the last two decades. Serial robots, due to their inherent drawbacks (Higher error amplification at the end effector, Greater weight to payload ratio, etc.), cannot be used in applications that require high accuracy across the workspace. Parallel robots overcome these drawbacks, making them a natural replacement for serial robots. However, they also have associated drawbacks (Small irregularly shaped workspace, many singularities in the workspace, etc.). For complex applications, the use of parallel robots instead of serial robots is preferred. For large-scale deployment of parallel manipulators in industries, remedial measures to overcome their drawbacks need to be developed. Most importantly, workspace optimization is required to exploit the full potential of these robots. This optimization is subject to one or more performance parameters (objectives) that often have conflicting requirements i.e. improving one objective deteriorates the performance of another, which is by far a severe challenge in this domain. An example of conflicting goals is “To purchase a car that is cheap, comfortable, safe, environment-friendly, high power and fuel-efficient”. In such cases, “best compromise between conflicting goals” is the best solution. Thus far, workspace optimization of parallel robots focuses on optimization concerning a single objective at a given time. The basic idea of this work is to propose a methodology to optimize the workspace of a PKM subject to multiple objectives simultaneously. Several optimization schemes including weighted averages, gradient descent, surrogate optimization, and genetic algorithms were studied. Pareto front optimization appears to be most suited to the application at hand.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信