Using Uncertainty Data in Chance-Constrained Trajectory Planning

Abstract

We consider the problem of trajectory planning in an environment comprised of a set of obstacles with uncertain locations. While previous approaches model the uncertainties with a prescribed Gaussian distribution, we consider the realistic case in which the distribution's moments are unknown and are learned online. We derive tight concentration bounds on the error of the estimated moments. These bounds are then used to derive a tractable and tight mixed-integer convex reformulation of the trajectory planning problem, assuming linear dynamics and polyhedral constraints. The solution of the resulting optimization program is a feasible solution for the original problem with high confidence. We illustrate the approach with a case study from autonomous driving.