ar X iv : 0 90 5 . 34 47 v 1 [ m at h . O C ] 2 1 M ay 2 00 9 On convex problems in chance - constrained stochastic model predictive control ⋆

نویسندگان

  • Eugenio Cinquemani
  • Mayank Agarwal
  • Debasish Chatterjee
  • John Lygeros
چکیده

We investigate constrained optimal control problems for linear stochastic dynamical systems evolving in discrete time. We consider minimization of an expected value cost over a finite horizon. Hard constraints are introduced first, and then reformulated in terms of probabilistic constraints. It is shown that, for a suitable parametrization of the control policy, a wide class of the resulting optimization problems are convex, or admit reasonable convex approximations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 90 5 . 25 85 v 1 [ m at h . C O ] 1 5 M ay 2 00 9 CHARACTERISTIC POINTS OF RECURSIVE SYSTEMS

Characteristic points have been a primary tool in the study of a generating function defined by a single recursive equation. We investigate the proper way to adapt this tool when working with multi-equation recursive systems.

متن کامل

ar X iv : 0 90 5 . 20 47 v 1 [ m at h . A T ] 1 3 M ay 2 00 9 KNASTER ’ S PROBLEM FOR ALMOST ( Z p ) k - ORBITS

In this paper some new cases of Knaster's problem on continuous maps from spheres are established. In particular, we consider an almost orbit of a p-torus X on the sphere, a continuous map f from the sphere to the real line or real plane, and show that X can be rotated so that f becomes constant on X.

متن کامل

ar X iv : 0 90 5 . 03 57 v 1 [ m at h . L O ] 4 M ay 2 00 9 A completeness result for the simply typed λ μ - calculus

In this paper, we define a realizability semantics for the simply typed λµ-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the computational behavior of some closed typed terms. We also prove a completeness result of our realizability semantics using a particular term model.

متن کامل

ar X iv : 0 90 5 . 03 71 v 1 [ m at h . L O ] 4 M ay 2 00 9 Complete Types in an Extension of the System AF 2

In this paper, we extend the system AF2 in order to have the subject reduction for the βη-reduction. We prove that the types with positive quantifiers are complete for models that are stable by weak-head expansion.

متن کامل

ar X iv : 0 90 5 . 04 56 v 1 [ m at h . L O ] 4 M ay 2 00 9 Non deterministic classical logic : the λ μ + + - calculus

In this paper, we present an extension of λμ-calculus called λμcalculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on data types. This calculus allows also to program the parallel-or.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009