{"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.