通过凸优化在线生成机器人与人的双协作轨迹

IF 9.1 1区 计算机科学 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
{"title":"通过凸优化在线生成机器人与人的双协作轨迹","authors":"","doi":"10.1016/j.rcim.2024.102850","DOIUrl":null,"url":null,"abstract":"<div><p>For dynamic collision-free trajectory planning in dual-robot and human collaborative tasks, this paper develops an online dual-robot Mutual Collision Avoidance (MCA) scheme based on convex optimization. A novel convex optimization formulation model, named Disciplined Convex programming by Shifting reference paths (DCS), is proposed for solving the single-robot trajectory optimization problem. Furthermore, a new dual-robot trajectory convex optimization algorithm is presented for online adjustment of the dual-robot trajectories according to the collaborative task priority. The overall pipeline, named DCS-MCA, generates collision-free and time-optimal dual-robot trajectories, while prioritizing the task accessibility of the high-priority robot. Simulation experiments demonstrate that DCS exhibits comparable performance to the current state-of-the-art single-robot motion planner, while the DCS-MCA outperforms common algorithms by up to 30% in time optimality for dual-robot collaborative tasks. The feasibility and dynamic performance of the proposed approach are further validated in a real collaborative cell, illustrating its suitability for collaborative dual-robot tasks in moderately dynamic environments.</p></div>","PeriodicalId":21452,"journal":{"name":"Robotics and Computer-integrated Manufacturing","volume":null,"pages":null},"PeriodicalIF":9.1000,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Online dual robot–human collaboration trajectory generation by convex optimization\",\"authors\":\"\",\"doi\":\"10.1016/j.rcim.2024.102850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>For dynamic collision-free trajectory planning in dual-robot and human collaborative tasks, this paper develops an online dual-robot Mutual Collision Avoidance (MCA) scheme based on convex optimization. A novel convex optimization formulation model, named Disciplined Convex programming by Shifting reference paths (DCS), is proposed for solving the single-robot trajectory optimization problem. Furthermore, a new dual-robot trajectory convex optimization algorithm is presented for online adjustment of the dual-robot trajectories according to the collaborative task priority. The overall pipeline, named DCS-MCA, generates collision-free and time-optimal dual-robot trajectories, while prioritizing the task accessibility of the high-priority robot. Simulation experiments demonstrate that DCS exhibits comparable performance to the current state-of-the-art single-robot motion planner, while the DCS-MCA outperforms common algorithms by up to 30% in time optimality for dual-robot collaborative tasks. The feasibility and dynamic performance of the proposed approach are further validated in a real collaborative cell, illustrating its suitability for collaborative dual-robot tasks in moderately dynamic environments.</p></div>\",\"PeriodicalId\":21452,\"journal\":{\"name\":\"Robotics and Computer-integrated Manufacturing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":9.1000,\"publicationDate\":\"2024-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Robotics and Computer-integrated Manufacturing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0736584524001376\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics and Computer-integrated Manufacturing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0736584524001376","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

针对双机器人与人类协作任务中的动态无碰撞轨迹规划,本文开发了一种基于凸优化的在线双机器人相互碰撞规避(MCA)方案。为解决单机器人轨迹优化问题,本文提出了一种新的凸优化表述模型,名为 "通过移动参考路径进行约束凸编程(DCS)"。此外,还提出了一种新的双机器人轨迹凸优化算法,用于根据协作任务优先级在线调整双机器人轨迹。整个管道被命名为 DCS-MCA,可生成无碰撞且时间最优的双机器人轨迹,同时优先考虑高优先级机器人的任务可达性。仿真实验证明,DCS 的性能与目前最先进的单机器人运动规划器相当,而 DCS-MCA 在双机器人协作任务的时间优化方面比普通算法高出 30%。建议方法的可行性和动态性能在实际协作单元中得到了进一步验证,说明它适用于中等动态环境中的双机器人协作任务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Online dual robot–human collaboration trajectory generation by convex optimization

For dynamic collision-free trajectory planning in dual-robot and human collaborative tasks, this paper develops an online dual-robot Mutual Collision Avoidance (MCA) scheme based on convex optimization. A novel convex optimization formulation model, named Disciplined Convex programming by Shifting reference paths (DCS), is proposed for solving the single-robot trajectory optimization problem. Furthermore, a new dual-robot trajectory convex optimization algorithm is presented for online adjustment of the dual-robot trajectories according to the collaborative task priority. The overall pipeline, named DCS-MCA, generates collision-free and time-optimal dual-robot trajectories, while prioritizing the task accessibility of the high-priority robot. Simulation experiments demonstrate that DCS exhibits comparable performance to the current state-of-the-art single-robot motion planner, while the DCS-MCA outperforms common algorithms by up to 30% in time optimality for dual-robot collaborative tasks. The feasibility and dynamic performance of the proposed approach are further validated in a real collaborative cell, illustrating its suitability for collaborative dual-robot tasks in moderately dynamic environments.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Robotics and Computer-integrated Manufacturing
Robotics and Computer-integrated Manufacturing 工程技术-工程:制造
CiteScore
24.10
自引率
13.50%
发文量
160
审稿时长
50 days
期刊介绍: The journal, Robotics and Computer-Integrated Manufacturing, focuses on sharing research applications that contribute to the development of new or enhanced robotics, manufacturing technologies, and innovative manufacturing strategies that are relevant to industry. Papers that combine theory and experimental validation are preferred, while review papers on current robotics and manufacturing issues are also considered. However, papers on traditional machining processes, modeling and simulation, supply chain management, and resource optimization are generally not within the scope of the journal, as there are more appropriate journals for these topics. Similarly, papers that are overly theoretical or mathematical will be directed to other suitable journals. The journal welcomes original papers in areas such as industrial robotics, human-robot collaboration in manufacturing, cloud-based manufacturing, cyber-physical production systems, big data analytics in manufacturing, smart mechatronics, machine learning, adaptive and sustainable manufacturing, and other fields involving unique manufacturing technologies.
×
引用
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学术官方微信