Sequential convex programming for non-linear stochastic optimal control

doi:10.1051/cocv/2022060

Sequential convex programming for non-linear stochastic optimal control

2022-10-20

0

OA

AI

DOI：10.1051/cocv/2022060

原文链接

原文求助

摘要

En 中文

This work introduces a sequential convex programming framework for non-linear, finitedimensional stochastic optimal control, where uncertainties are modeled by a multidimensional Wiener process. We prove that any accumulation point of the sequence of iterates generated by sequential convex programming is a candidate locally-optimal solution for the original problem in the sense of the stochastic Pontryagin Maximum Principle. Moreover, we provide sufficient conditions for the existence of at least one such accumulation point. We then leverage these properties to design a practical numerical method for solving non-linear stochastic optimal control problems based on a deterministic transcription of stochastic sequential convex programming.

Sequential convex programming for non-linear stochastic optimal control

摘要

期刊

机构

引用论文