Convexity and convex approximations of discrete-time stochastic control problems with constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Automatica Year : 2011

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.

Dates and versions

hal-00793041 , version 1 (21-02-2013)

Identifiers

Cite

Eugenio Cinquemani, Mayank Agarwal, Debasish Chatterjee, John Lygeros. Convexity and convex approximations of discrete-time stochastic control problems with constraints. Automatica, 2011, 47, pp.2082-2087. ⟨10.1016/j.automatica.2011.01.023⟩. ⟨hal-00793041⟩
195 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More