This tutorial presents OpenSCvx, an open-source Python framework that bridges the gap between high-level problem specification and efficient numerical optimization and provides a symbolic modeling interface that automatically constructs and solves trajectory optimization problems from modular descriptions of objectives, dynamics, and constraints.
Abstract
Trajectory optimization computes dynamically feasible motions that enable autonomous systems to accomplish complex tasks while satisfying operational and environmental constraints. This tutorial presents OpenSCvx, an open-source Python framework that bridges the gap between high-level problem specification and efficient numerical optimization. Rather than requiring users to derive solver-specific mathematical formulations, OpenSCvx provides a symbolic modeling interface that automatically constructs and solves trajectory optimization problems from modular descriptions of objectives, dynamics, and constraints. Beyond simplifying problem formulation, OpenSCvx supports (i) continuous-time constraint modeling, (ii) temporal and logical specifications, (iii) automatic vectorization for scalable and batched optimization, and (iv) a modular architecture that enables new algorithms, models, and solver backends to be incorporated with minimal effort. These capabilities allow researchers and practitioners to rapidly prototype, solve, and extend state-of-the-art trajectory optimization methods.
We present a fast numerical method for safe continuous-time motion planning under Temporal Logic (TL) specifications. The method generates smooth continuous trajectories that remain collision-free while robustly satisfying temporal and logical task requirements. A central component of our method is the formulation of n...
Lukas Pries, Joris Verhagen, Jon Arrizabalaga et al.· 0 citations
Optimization problems (OPs) are key to solving many challenging research problems in robotics. However, reproducibility still remains a major issue. In this paper, we present Amplify, a lightweight nonlinear programming library aimed at reproducible results of robotic-related trajectory optimization problems. The minim...
A new approach for computing gradients of analytic IK parameterizations is presented, using the inverse function theorem to recover the desired gradients from the ordinary forward kinematic Jacobian, and a least-squares domain extension and an optimization-amenable description of the reachability constraint are present...
Thomas Cohn, Seiji Shaw, Harel Biggie et al.· 2 citations
Modern space missions require trajectory design methods capable of efficiently adapting to diverse mission objectives and operational constraints. Despite the maturity of non-convex trajectory optimization techniques, their broader adoption remains limited by the substantial domain expertise required to tailor problem...
Eleanor Brosius, Yuji Takubo, Daniele Gammelli et al.· 0 citations
This work explores a new axis of vectorization built upon reparameterizing the planning space through analytic IK, and shows that the planner can synthesize plans in microseconds to milliseconds for high dimensional systems, with complex constraints, up to 10x faster than the current state-of-the-art.
S. R. Iyer, Thomas Cohn, Zachary Kingston· 0 citations
BLAST is proposed, a biconvex, limit-aware path-and-timing optimization framework that couples B-spline collision-free path optimization with velocity and acceleration profiling under explicit dynamical and operational constraints and retains computational tractability while incorporating actuator limits and system dyn...
Gerhard Reinerth, Riddhiman Laha, L. Figueredo et al.· IEEE Robotics and Automation...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.