Obstacle avoidance planning for industrial robots based on singular manifold splitting configuration space

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-09-11 DOI:10.1002/cpe.8245
Yibo Liu, Xuyan Zhang, Chaoqun Wu, Minghui Yang
{"title":"Obstacle avoidance planning for industrial robots based on singular manifold splitting configuration space","authors":"Yibo Liu,&nbsp;Xuyan Zhang,&nbsp;Chaoqun Wu,&nbsp;Minghui Yang","doi":"10.1002/cpe.8245","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Obstacle avoidance planning is the primary element in ensuring safe robot applications such as welding, assembly, and drilling. The states in the configuration space (C-space) provide the pose information of any part of the manipulator and are preferentially considered in motion planning. However, it is difficult to express the environmental information directly in the high dimensional C-space, limiting the application of C-space obstacle avoidance planning. This paper proposes a singular manifold splitting C-space method and designs a compatible obstacle avoidance strategy. The specific method is as follows: first, according to the specific structure of industrial robots, arm-wrist separation obstacle avoidance planning is proposed to fix the robot as a 3R manipulator to reduce the dimension of C-space. Next, the C-space is segmented according to the singular manifolds, and the unique domain is delineated to complete the streamlining of the volume of the C-space. Then, with the help of the point cloud, the obstacles are enveloped and mapped to the unique domain to construct the pseudo-obstacle map. Industrial robots' obstacle avoidance planning is completed based on the pseudo-obstacle map combined with an improved Rapidly-Exploring Random Trees (RRT) algorithm. This method dramatically improves the efficiency of obstacle avoidance planning in the C-space and avoids the effect of singularities on industrial robots. Finally, the effectiveness of the method is verified by physical experiments.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 26","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8245","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Obstacle avoidance planning is the primary element in ensuring safe robot applications such as welding, assembly, and drilling. The states in the configuration space (C-space) provide the pose information of any part of the manipulator and are preferentially considered in motion planning. However, it is difficult to express the environmental information directly in the high dimensional C-space, limiting the application of C-space obstacle avoidance planning. This paper proposes a singular manifold splitting C-space method and designs a compatible obstacle avoidance strategy. The specific method is as follows: first, according to the specific structure of industrial robots, arm-wrist separation obstacle avoidance planning is proposed to fix the robot as a 3R manipulator to reduce the dimension of C-space. Next, the C-space is segmented according to the singular manifolds, and the unique domain is delineated to complete the streamlining of the volume of the C-space. Then, with the help of the point cloud, the obstacles are enveloped and mapped to the unique domain to construct the pseudo-obstacle map. Industrial robots' obstacle avoidance planning is completed based on the pseudo-obstacle map combined with an improved Rapidly-Exploring Random Trees (RRT) algorithm. This method dramatically improves the efficiency of obstacle avoidance planning in the C-space and avoids the effect of singularities on industrial robots. Finally, the effectiveness of the method is verified by physical experiments.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于奇异流形分割配置空间的工业机器人避障规划
摘要避障规划是确保焊接、装配和钻孔等机器人应用安全的首要因素。配置空间(C-space)中的状态提供了机械手任何部分的姿态信息,在运动规划中优先考虑。然而,在高维 C 空间中很难直接表达环境信息,这限制了 C 空间避障规划的应用。本文提出了一种奇异流形分割 C 空间方法,并设计了一种兼容的避障策略。具体方法如下:首先,根据工业机器人的具体结构,提出臂腕分离避障规划,将机器人固定为 3R 机械手,以降低 C 空间维度。其次,根据奇异流形对 C 空间进行分割,划定唯一域,完成 C 空间体积的精简。然后,在点云的帮助下,将障碍物包络并映射到唯一域,从而构建伪障碍物图。根据伪障碍物图,结合改进的快速探索随机树(RRT)算法,完成工业机器人的避障规划。该方法显著提高了 C 空间避障规划的效率,并避免了奇点对工业机器人的影响。最后,物理实验验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
Issue Information Improving QoS in cloud resources scheduling using dynamic clustering algorithm and SM-CDC scheduling model Issue Information Issue Information Camellia oleifera trunks detection and identification based on improved YOLOv7
×
引用
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