Xianjian Jin, Zeyuan Yan, Hang Yang, Qikang Wang, Guo-dong Yin
{"title":"A Goal-Biased RRT Path Planning Approach for Autonomous Ground Vehicle","authors":"Xianjian Jin, Zeyuan Yan, Hang Yang, Qikang Wang, Guo-dong Yin","doi":"10.1109/CVCI51460.2020.9338597","DOIUrl":null,"url":null,"abstract":"For the application of autonomous ground vehicle (AGV) operating in unstructured environment, a path planning method based on an improved goal-biased Rapidly-exploring Random Trees (bias-RRT) is proposed. The algorithm combines random sampling with numerical optimization to achieve fast convergence speed and satisfy constraints. KD-Tree and potential field of the environment are implemented to increase the sampling efficiency, and cubic B-splines are used to smooth the path for better tracking performance. The algorithm improves the efficiency of searching while guarantee safety and quality of the planned path. Simulation results verify the effectiveness of the proposed method.","PeriodicalId":119721,"journal":{"name":"2020 4th CAA International Conference on Vehicular Control and Intelligence (CVCI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 4th CAA International Conference on Vehicular Control and Intelligence (CVCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CVCI51460.2020.9338597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
For the application of autonomous ground vehicle (AGV) operating in unstructured environment, a path planning method based on an improved goal-biased Rapidly-exploring Random Trees (bias-RRT) is proposed. The algorithm combines random sampling with numerical optimization to achieve fast convergence speed and satisfy constraints. KD-Tree and potential field of the environment are implemented to increase the sampling efficiency, and cubic B-splines are used to smooth the path for better tracking performance. The algorithm improves the efficiency of searching while guarantee safety and quality of the planned path. Simulation results verify the effectiveness of the proposed method.