Convexity and convex approximations of discrete-time stochastic control problems with constraints

  • Authors:
  • Eugenio Cinquemani;Mayank Agarwal;Debasish Chatterjee;John Lygeros

  • Affiliations:
  • INRIA Grenoble-Rhône-Alpes, 655 avenue de l'Europe, Montbonnot, 38334 Saint Ismier cedex, France;Department of Electrical Engineering, Stanford University, CA, USA;Automatic Control Laboratory, Physikstrasse 3, ETH Zürich, 8092 Zürich, Switzerland;Automatic Control Laboratory, Physikstrasse 3, ETH Zürich, 8092 Zürich, Switzerland

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 2011

Quantified Score

Hi-index 22.15

Visualization

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.