Abstract: Rapidly-exploring random tree (RRT) has been studied for autonomous parking as it quickly finds an initial path and is easily scalable in complex environments. However, the planning time ...
Abstract: To address the shortcomings of the classical RRT (Rapidly exploring Range Tree) path planning algorithm, such as long planning time and path curvature in some narrow and complex environments ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback