arXiv Analytics

Sign in

arXiv:2009.05182 [math.OC]AbstractReferencesReviewsResources

Sequential Convex Programming For Non-Linear Stochastic Optimal Control

Riccardo Bonalli, Thomas Lew, Marco Pavone

Published 2020-09-11Version 1

We introduce a sequential convex programming framework to solve general non-linear stochastic optimal control problems in finite dimension, where uncertainties are modeled by a multidimensional Wiener process. We provide sufficient conditions for the convergence of the method. Moreover, we prove that, when convergence is achieved, sequential convex programming finds a candidate locally optimal solution for the original problem in the sense of the stochastic Pontryagin Maximum Principle. We leverage those properties to design a practical numerical method to solve non-linear stochastic optimal control problems that is based on a deterministic transcription of stochastic sequential convex programming.

Related articles: Most relevant | Search more
arXiv:2404.16269 [math.OC] (Published 2024-04-25)
Expected Time-Optimal Control: a Particle MPC-based Approach via Sequential Convex Programming
arXiv:2101.00202 [math.OC] (Published 2021-01-01)
Sequential Convex Programming for Collaboration of Connected and Automated Vehicles
arXiv:2009.05038 [math.OC] (Published 2020-09-10, updated 2021-01-04)
Analysis of Theoretical and Numerical Properties of Sequential Convex Programming for Continuous-Time Optimal Control