T^⋆-Lite: A Fast Time-Risk Optimal Motion Planning Algorithm for Multi-Speed Autonomous Vehicles
share
In this paper, we develop a new algorithm, called T^⋆-Lite, that enables fast time-risk optimal motion planning for variable-speed autonomous vehicles. The T^⋆-Lite algorithm is a significantly faster version of the previously developed T^⋆ algorithm. T^⋆-Lite uses the novel time-risk cost function of T^⋆; however, instead of a grid-based approach, it uses an asymptotically optimal sampling-based motion planner. Furthermore, it utilizes the recently developed Generalized Multi-speed Dubins Motion-model (GMDM) for sample-to-sample kinodynamic motion planning. The sample-based approach and GMDM significantly reduce the computational burden of T^⋆ while providing reasonable solution quality. The sample points are drawn from a four-dimensional configuration space consisting of two position coordinates plus vehicle heading and speed. Specifically, T^⋆-Lite enables the motion planner to select the vehicle speed and direction based on its proximity to the obstacle to generate faster and safer paths. In this paper, T^⋆-Lite is developed using the RRT^⋆ motion planner, but adaptation to other motion planners is straightforward and depends on the needs of the planner
READ FULL TEXT