| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
Convexity and convex approximations of discrete-time stochastic control problems with constraints
Abstract : We investigate constrained optimal control problems for linear stochastic dynamical systems evolving in discrete time. We consider minimization of an expected value cost subject to probabilistic constraints. We study the convexity of a finite-horizon optimization problem in the case where the control policies are affine functions of the disturbance input. We propose an expectation-based method for the convex approximation of probabilistic constraints with polytopic constraint function, and a Linear Matrix Inequality (LMI) method for the convex approximation of probabilistic constraints with ellipsoidal constraint function. Finally, we introduce a class of convex expectation-type constraints that provide tractable approximations of the so-called integrated chance constraints. Performance of these methods and of existing convex approximation methods for probabilistic constraints is compared on a numerical example.
https://hal.inria.fr/hal-00793041
Contributor : Gaëlle Rivérieux Connect in order to contact the contributor
Submitted on : Thursday, February 21, 2013 - 2:33:37 PM
Last modification on : Thursday, January 20, 2022 - 4:16:16 PM
Contributor : Gaëlle Rivérieux Connect in order to contact the contributor
Submitted on : Thursday, February 21, 2013 - 2:33:37 PM
Last modification on : Thursday, January 20, 2022 - 4:16:16 PM
Links full text
