DLCvx: Lossless Convexification to discrete-time optimal control problems.

We optimize location, timing, magnitude and direction of a finite number of impulses to maximize loitering time around a given target, while satisfying state path constraints continuously over the full time-horizon.

QOCO, a C-based solver for second-order cone programs with quadratic objectives using a primal-dual interior point method, and QOCOGEN, a code generator that creates faster and library-free custom solvers for specific problem families.

A smooth, sound and complete robustness measure (D-GMSR) to integrate temporal and logical specifications into optimization problems.

Successive convexification, a real-time solution for nonconvex trajectory optimization that ensures continuous-time constraint satisfaction, guaranteed convergence, and robust performance.

Constrained Visibility Guidance (CVG) presents a novel approach to modeling terrain scanning constraints for powered landing maneuvers using a theory of constrained conic intersections.

HALO presents a combined perception (HALSS) and trajectory planning (Adaptive-DDTO) solution towards contingency planning for landing maneuvers with multiple candidate landing sites.