← Search

Mathew Halm

5 accepted papers

2025

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

RSS 2025poster

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…

Cited by 1PDFcodeScholar
2020

ContactNets: Learning Discontinuous Contact Dynamics with Smooth, Implicit Representations

CoRL 2020

Common methods for learning robot dynamics assume motion is continuous, causing unrealistic model predictions for systems undergoing discontinuous impact and stiction behavior. In this work, we resolve this conflict with a smooth, implicit encoding of the structure inherent to contact-induced discon