RRTs Review and Statistical Analysis
Ahmad Abbadi, Radomil Matoušek · 2012
Abstract— Path planning is one of the important issues in robotics area. There are many ideas to deal with this issue one of them is RRT (Rapidly Exploring Random Tree). This method is not optimal but it reduces the time needed for obtaining solutions. This algorithm is based on portability, the result of this algorithm is a tortuous path which has a lot of useless points. In this paper we introduce some variants of RRTs and a method for reduce a degree of tortuous, making the path shorter and omitting useless points. Also because of RRT's randomizes we make some statistical test on many variations of RRT, to make decisions about the best variations.