Path Planning Obstacle Avoidance Algorithm Based on Wheeled Robot

Lin Yao, Xu Yuanyuan, Xu Shaoyu, L. Yurong, Jiang Hongyu
{"title":"Path Planning Obstacle Avoidance Algorithm Based on Wheeled Robot","authors":"Lin Yao, Xu Yuanyuan, Xu Shaoyu, L. Yurong, Jiang Hongyu","doi":"10.1109/IWECAI50956.2020.00019","DOIUrl":null,"url":null,"abstract":"There are many obstacles and movements in the indoor environment. Indoor robots need to cope with the changing environment. This paper studies the obstacle avoidance problem of wheeled robots moving in an unknown environment. Firstly, the dynamic path planning algorithm for robot autonomous obstacle avoidance is studied, and the algorithm is implemented in C# language. Then use the Unity3D game engine to simulate the algorithm. The innovations of this algorithm are as follows: 1. Vectorize the path of the robot; 2. Summarize the motion state of the obstacle and the robot into six cases. During the movement process, the obstacle movement state is continuously judged, and the speed and direction of the obstacle are analyzed. The judgment result must belong to six situations. The experiment proves that the algorithm can solve the obstacle avoidance problem when encountering obstacles of different speeds and sizes, and has stronger applicability.","PeriodicalId":364789,"journal":{"name":"2020 International Workshop on Electronic Communication and Artificial Intelligence (IWECAI)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Workshop on Electronic Communication and Artificial Intelligence (IWECAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWECAI50956.2020.00019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

There are many obstacles and movements in the indoor environment. Indoor robots need to cope with the changing environment. This paper studies the obstacle avoidance problem of wheeled robots moving in an unknown environment. Firstly, the dynamic path planning algorithm for robot autonomous obstacle avoidance is studied, and the algorithm is implemented in C# language. Then use the Unity3D game engine to simulate the algorithm. The innovations of this algorithm are as follows: 1. Vectorize the path of the robot; 2. Summarize the motion state of the obstacle and the robot into six cases. During the movement process, the obstacle movement state is continuously judged, and the speed and direction of the obstacle are analyzed. The judgment result must belong to six situations. The experiment proves that the algorithm can solve the obstacle avoidance problem when encountering obstacles of different speeds and sizes, and has stronger applicability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于轮式机器人的路径规划避障算法
室内环境中有许多障碍物和运动。室内机器人需要适应不断变化的环境。研究了轮式机器人在未知环境下的避障问题。首先,研究了机器人自主避障的动态路径规划算法,并用c#语言实现了该算法。然后使用Unity3D游戏引擎对算法进行仿真。该算法的创新点如下:矢量化机器人的路径;2. 将障碍物和机器人的运动状态归纳为六种情况。在运动过程中,连续判断障碍物的运动状态,分析障碍物的速度和方向。判断结果必须属于六种情况。实验证明,该算法能够解决遇到不同速度和大小障碍物时的避障问题,具有较强的适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Named Entity Recognition Method with Word Position Research on Application of Smart Agriculture in Cotton Production Management Path Analysis of Using Big Data to Innovate Archives Management Model and Improve Service Ability The Air-Ground Integrated MIMO Cooperative Relay Beamforming Wireless Ad-Hoc Network Technology Research That Based on Maximum Ratio Combining Research and Exploration of Virtual Simulation Laboratory in Private Colleges and Universities
×
引用
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