{"title":"Obstacle avoidance path planning of space manipulator based on improved RRT algorithm","authors":"W. Bai, Xingzhi Xu","doi":"10.1117/12.2660134","DOIUrl":null,"url":null,"abstract":"The traditional rapid expansion random tree (RRT) algorithm has poor efficiency in the motion planning of the manipulator. Based on the traditional RRT algorithm, this paper introduces the target offset strategy in the process of expanding leaf nodes. When the algorithm falls into a local minimum, it will select the expansion point, so as to quickly break away from the minimum. The improved RRT algorithm and other algorithms are simulated in Mathematica. The experimental results show that the improved algorithm can guide the growth direction of the tree, improve the convergence speed of the algorithm, make it difficult to fall into local minimum, and improve the motion planning efficiency of the manipulator in simulation.","PeriodicalId":329761,"journal":{"name":"International Conference on Informatics Engineering and Information Science","volume":"183 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Informatics Engineering and Information Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2660134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
The traditional rapid expansion random tree (RRT) algorithm has poor efficiency in the motion planning of the manipulator. Based on the traditional RRT algorithm, this paper introduces the target offset strategy in the process of expanding leaf nodes. When the algorithm falls into a local minimum, it will select the expansion point, so as to quickly break away from the minimum. The improved RRT algorithm and other algorithms are simulated in Mathematica. The experimental results show that the improved algorithm can guide the growth direction of the tree, improve the convergence speed of the algorithm, make it difficult to fall into local minimum, and improve the motion planning efficiency of the manipulator in simulation.