paper-journal

We present a biconvex approach for minimum-time motion planning around convex obstacles that is guaranteed to converge, is anytime, and supports derivative constraints to arbitrary order.
[TRO, under review]

We extend prior work and now enable the computation of collision-free polytopes in a rational parametrization of robot configuration space for more general systems while only using convex optimization.
[Submitted to IJRR]