Research on Robot Obstacle Avoidance Method Based on Digital Twin

Lei Wang, Yongfei Xiao
{"title":"Research on Robot Obstacle Avoidance Method Based on Digital Twin","authors":"Lei Wang, Yongfei Xiao","doi":"10.1145/3548608.3559179","DOIUrl":null,"url":null,"abstract":"This paper studies a collaborative robot obstacle avoidance method based on digital twin technology, by establishing a digital twin of the robot, collecting and transmitting the twin data, so that the virtual model and the robot entity can map each other to realize the virtual reality and real-time monitoring of the robot operation state. A robot obstacle avoidance path planning method based on the improved artificial potential field method is proposed. Find the closest point of each linkage of the robot to the obstacle and add the reverse control force based on the potential field function to achieve obstacle avoidance of the robot. The simulation debugging is carried out on the Unity 3D software platform, and the results show that the robot can achieve collision-free motion in the process of reaching the target point, which verifies the feasibility of the method.","PeriodicalId":201434,"journal":{"name":"Proceedings of the 2022 2nd International Conference on Control and Intelligent Robotics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 2nd International Conference on Control and Intelligent Robotics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3548608.3559179","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper studies a collaborative robot obstacle avoidance method based on digital twin technology, by establishing a digital twin of the robot, collecting and transmitting the twin data, so that the virtual model and the robot entity can map each other to realize the virtual reality and real-time monitoring of the robot operation state. A robot obstacle avoidance path planning method based on the improved artificial potential field method is proposed. Find the closest point of each linkage of the robot to the obstacle and add the reverse control force based on the potential field function to achieve obstacle avoidance of the robot. The simulation debugging is carried out on the Unity 3D software platform, and the results show that the robot can achieve collision-free motion in the process of reaching the target point, which verifies the feasibility of the method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于数字孪生的机器人避障方法研究
本文研究了一种基于数字孪生技术的协作机器人避障方法,通过建立机器人的数字孪生,采集和传输孪生数据,使虚拟模型与机器人实体相互映射,实现对机器人运行状态的虚拟现实和实时监控。提出了一种基于改进人工势场法的机器人避障路径规划方法。找出机器人各连杆离障碍物最近的点,并根据势场函数加入反向控制力,实现机器人避障。在Unity 3D软件平台上进行了仿真调试,结果表明机器人在到达目标点的过程中可以实现无碰撞运动,验证了该方法的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Study on Optimization of cold chain logistics distribution path of agricultural products in Hefei Design and Implementation of a Batteryless Pedometer based on a Motion Tracking Sensor Rapid visual positioning of sheet metal parts based on electronic drawing templates An analysis of hot topics and trends in foreign 3D printing technology research——analysis of knowledge graphs based on citation indexes such as SSCI Tibetan Jiu Chess Game Algorithm based on Expert Knowledge
×
引用
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