RJ-RRT: Improved RRT for Path Planning in Narrow Passages
As a representative of sampling-based planning algorithms, rapidly exploring random tree (RRT), is extensively welcomed in solving robot path planning problems due to 151 its wide application range and easy addition of nonholonomic constraints.However, it is still challenging for RRT to plan the path for configuration space with narrow passages.As