Andrew Marchese

A Biconvex Method for Minimum-Time Motion Planning Through Sequences of Convex Sets

We consider the problem of designing a smooth trajectory that traverses a sequence of convex sets in minimum time, while satisfying given velocity and acceleration constraints. This problem is naturally formulated as a nonconvex program. To solve it, we propose a biconvex method that quickly produce…