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 produces an initial trajectory and iteratively refines it by solving two convex subproblems in alternation. This method is guaranteed to converge, returns a feasible trajectory even if stopped early, and does not require the selection of any line-search or trust-region parameter. Exhaustive experiments show that our method finds high-quality trajectories in a fraction of the time of state-of-the-art solvers for nonconvex optimization. In addition, it achieves runtimes comparable to industry-standard waypoint-based motion planners, while consistently designing lower-duration trajectories than existing optimization-based planners.

@article{marcucci2025_2504.18978,
  title={ A biconvex method for minimum-time motion planning through sequences of convex sets },
  author={ Tobia Marcucci and Mathew Halm and Will Yang and Dongchan Lee and Andrew D. Marchese },
  journal={arXiv preprint arXiv:2504.18978},
  year={ 2025 }
}