An RRT-Based Path Planning Strategy in a Dynamic Environment

Yijing Li
{"title":"An RRT-Based Path Planning Strategy in a Dynamic Environment","authors":"Yijing Li","doi":"10.1109/ICARA51699.2021.9376472","DOIUrl":null,"url":null,"abstract":"The real-time RRT-based path planning strategy is designed for the non-holonomic robot in a dynamic environment. The sampling-based strategy, which consists of a pre-processing RRT path planner and a real-time planner, navigate the robot to avoid the unknown moving obstacle, which is time-varying or move randomly. Additionally, the algorithm contains a simple temporary target determination function, and ensures its feasibility in the target-unknown situation. It decreases the realtime computational complexity because of the omission of moving obstacle segmentation, velocity computation, or original path replanning. The feasibility of the navigation strategy is verified by using computation simulation.","PeriodicalId":183788,"journal":{"name":"2021 7th International Conference on Automation, Robotics and Applications (ICARA)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 7th International Conference on Automation, Robotics and Applications (ICARA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARA51699.2021.9376472","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The real-time RRT-based path planning strategy is designed for the non-holonomic robot in a dynamic environment. The sampling-based strategy, which consists of a pre-processing RRT path planner and a real-time planner, navigate the robot to avoid the unknown moving obstacle, which is time-varying or move randomly. Additionally, the algorithm contains a simple temporary target determination function, and ensures its feasibility in the target-unknown situation. It decreases the realtime computational complexity because of the omission of moving obstacle segmentation, velocity computation, or original path replanning. The feasibility of the navigation strategy is verified by using computation simulation.
动态环境下基于rrt的路径规划策略
针对动态环境下的非完整机器人,设计了基于rrt的实时路径规划策略。基于采样的策略由预处理RRT路径规划器和实时规划器组成,引导机器人避开时变或随机移动的未知移动障碍物。此外,该算法还包含了一个简单的临时目标确定函数,保证了该算法在目标未知情况下的可行性。该算法省去了移动障碍物分割、速度计算和原路径重规划,降低了实时计算复杂度。通过计算仿真验证了该导航策略的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信