“…The Rapidly-exploring Random Tree (RRT) algorithm commonly referred to in the field is actually heuristically biasing RRT (HBRRT) [ 3 ], target-biased RRT (TBRRT) [ [4] , [5] , [6] , [7] ], goal-biased RRT (GBRRT) [ [8] , [9] , [10] , [11] ], goal-oriented RRT (GORRT) [ [12] , [13] , [14] ] or goal-directed RRT algorithm (GDRRT) [ [15] , [16] , [17] , [18] ], the idea of this algorithm is to take the initial position as the root node and then add leaf nodes by random sampling. When the leaf nodes of the random tree arrive at the target position, the path from the initial position to the goal position is planned.…”