The rapidly exploring random tree (RRT) is a widely used algorithm in path planning. However, the algorithm has an excessively large sampling range, overly random sampling, and numerous invalid ...

This article presents a framework that extends a rapidly exploring random tree (RRT) algorithm to plan the motion for a wheeled robot under kinodynamic constraints. Unlike previous RRT-based path ...