REVIEW 7 cited by
Fast and Certifiable Trajectory Optimization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We propose semidefinite trajectory optimization (STROM), a framework that computes fast and certifiably optimal solutions for nonconvex trajectory optimization problems defined by polynomial objectives and constraints. STROM employs sparse second-order Lasserre's hierarchy to generate semidefinite program (SDP) relaxations of trajectory optimization. Different from existing tools (e.g., YALMIP and SOSTOOLS in Matlab), STROM generates chain-like multiple-block SDPs with only positive semidefinite (PSD) variables. Moreover, STROM does so two orders of magnitude faster. Underpinning STROM is cuADMM, the first ADMM-based SDP solver implemented in CUDA and runs in GPUs (with C/C++ extension). cuADMM builds upon the symmetric Gauss-Seidel ADMM algorithm and leverages GPU parallelization to speedup solving sparse linear systems and projecting onto PSD cones. In five trajectory optimization problems (inverted pendulum, cart-pole, vehicle landing, flying robot, and car back-in), cuADMM computes optimal trajectories (with certified suboptimality below 1%) in minutes (when other solvers take hours or run out of memory) and seconds (when others take minutes). Further, when warmstarted by data-driven initialization in the inverted pendulum problem, cuADMM delivers real-time performance: providing certifiably optimal trajectories in 0.66 seconds despite the SDP has 49,500 variables and 47,351 constraints.
Forward citations
Cited by 7 Pith papers
-
Global Contact-Rich Planning with Sparsity-Rich Semidefinite Relaxations
Sparse semidefinite relaxations, exploiting correlative, term, and robotics-specific sparsity, solve contact-rich planning problems to certified near-global optimality in seconds for several benchmark tasks.
-
WarpMPC: Large-Batch MPC on GPU via ADMM with Unrolled $LDL^\top$ Factorization
Unrolled sparse LDL^T factorizations with memory layout, segmentation, and level-scheduled backsolves yield 8k–250k SQP iterations per second for large-batch MPC on GPU, 3–25× faster than baselines.
-
Synthesis of safety certificates for discrete-time uncertain systems via convex optimization
The paper derives SDPs that co-design quadratic control barrier functions and linear feedback controllers, certifying worst-case or probabilistic safety for discrete-time uncertain linear systems.
-
Riemannian Direct Trajectory Optimization of Rigid Bodies on Matrix Lie Groups
A constrained Riemannian interior point method with closed-form Lie group derivatives performs direct trajectory optimization on SO(3)xR^3 and speeds up single-rigid-body planning.
-
A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling
A new semidefinite relaxation jointly optimizes trajectories, control inputs, and time scaling for linear and piecewise-affine systems, and extends to mode-sequence optimization via graphs of convex sets.
-
Building Rome with Convex Optimization
A depth-lifted bundle adjustment reformulated as a convex SDP can be solved globally on GPU, yielding a fast and scalable SfM pipeline.
-
On the Surprising Robustness of Sequential Convex Optimization for Contact-Implicit Motion Planning
CRISP is a primal-only sequential convex programming solver with a weighted l1 penalty merit function that solves contact-implicit motion planning problems from all-zero initialization.
Discussion (0). Continue with ORCID to comment.