By Topic

An Efficient Method to Estimate the Suboptimality of Affine Controllers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hadjiyiannis, M.J. ; Dept. of Comput., Imperial Coll. London, London, UK ; Goulart, P.J. ; Kuhn, D.

We consider robust feedback control of time-varying, linear discrete-time systems operating over a finite horizon. For such systems, we consider the problem of designing robust causal controllers that minimize the expected value of a convex quadratic cost function, subject to mixed linear state and input constraints. Determination of an optimal control policy for such problems is generally computationally intractable, but suboptimal policies can be computed by restricting the class of admissible policies to be affine on the observation. By using a suitable re-parameterization and robust optimization techniques, these approximations can be solved efficiently as convex optimization problems. We investigate the loss of optimality due to the use of such affine policies. Using duality arguments and by imposing an affine structure on the dual variables, we provide an efficient method to estimate a lower bound on the value of the optimal cost function for any causal policy, by solving a cone program whose size is a polynomial function of the problem data. This lower bound can then be used to quantify the loss of optimality incurred by the affine policy.

Published in:

Automatic Control, IEEE Transactions on  (Volume:56 ,  Issue: 12 )