GuSTO: Guaranteed Sequential Trajectory Optimization via Sequential Convex Programming

Abstract

Sequential Convex Programming (SCP) has recently seen a surge of interest as a tool for trajectory optimization. However, most available methods lack rigorous performance guarantees and they are often tailored to specific optimal control setups. In this paper, we present GuSTO (Guaranteed Sequential Trajectory Optimization), an algorithmic framework to solve trajectory optimization problems for control-affine systems with drift. GuSTO generalizes earlier SCP-based methods for trajectory optimization (by addressing, for example, goal-set constraints and problems with either fixed or free final time) and enjoys theoretical convergence guarantees in terms of convergence to, at least, a stationary point. The theoretical analysis is further leveraged to devise an accelerated implementation of GuSTO, which originally infuses ideas from indirect optimal control into an SCP context. Numerical experiments on a variety of trajectory optimization setups show that GuSTO generally outperforms current state-of-the-art approaches in terms of success rates, solution quality, and computation times.

Extended version

Cited by in corpus (10)

• Online Motion Planning based on Nonlinear Model Predictive Control with Non-Euclidean Rotation Groups
• Variable-Horizon Guidance for Autonomous Rendezvous and Docking to a Tumbling Target
• Successive Convexification with Feasibility Guarantee via Augmented Lagrangian for Non-Convex Optimal Control Problems
• Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems
• Convex Optimization for Trajectory Generation
• Learning Mixed-Integer Convex Optimization Strategies for Robot Planning and Control
• Lossless convexification of non-convex optimal control problems with disjoint semi-continuous inputs
• CIAO${}^{\star }$: MPC-based Safe Motion Planning in Predictable Dynamic Environments
• Proportional-Integral Projected Gradient Method for Model Predictive Control
• Optimal Science-time Reorientation Policy for the Comet Interceptor Flyby via Sequential Convex Programming