𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic robust design with linear quadratic regulators

✍ Scribed by B.T. Polyak; R. Tempo


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
126 KB
Volume
43
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper, we study robust design of uncertain systems in a probabilistic setting by means of linear quadratic regulators (LQR). We consider systems a ected by random bounded nonlinear uncertainty so that classical optimization methods based on linear matrix inequalities cannot be used without conservatism. The approach followed here is a blend of randomization techniques for the uncertainty together with convex optimization for the controller parameters. In particular, we propose an iterative algorithm for designing a controller which is based upon subgradient iterations. At each step of the sequence, we ΓΏrst generate a random sample and then we perform a subgradient step for a convex constraint deΓΏned by the LQR problem. The main result of the paper is to prove that this iterative algorithm provides a controller which quadratically stabilizes the uncertain system with probability one in a ΓΏnite number of steps. In addition, at a ΓΏxed step, we compute a lower bound of the probability that a quadratically stabilizing controller is found.


πŸ“œ SIMILAR VOLUMES


Linear quadratic regulators with eigenva
✍ Leang S. Shieh; Hani M. Dib; Sekar Ganesan πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 441 KB

A linear optimal quadratic regulator is developed for optimally placing the closed-loop poles of multivariable continuous-time systems within the common region of an open sector, bounded by lines inclined at +zt/2k (k = 2 or 3) from the negative real axis with a sector angle ---~t/2, and the left-ha

Robust linear regulator design for discr
✍ BasΓ­lio E.A. Milani; AndrΓ©a N. Carvalho πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 516 KB

Ahstraet-The robust linear constrained regulation problem for uncertain linear discrete-time systems (A, B) is investigated using the theory of positively invariant polyhedral sets. Closed and bounded polyhedral uncertain domains are considered, involving parameters of both A and B-matrices and poly