Randomized algorithms for probabilistic robustness with real and complex structured uncertainty

doi:10.1109/9.895560

2000-01-01

118

Giuseppe C. Calafiore *

Fabrizio Dabbene

DOI：10.1109/9.895560

原文链接

原文求助

摘要

En 中文

In recent Sears, there has been a growing interest in developing randomized algorithms for probabilistic robustness of uncertain control systems, Unlike classical worst case methods, these algorithms provide probabilistic estimates assessing, for instance, if a certain design specification is met with a given probability. One of the advantages of this approach is that the robustness margins can be often increased by a considerable amount, at the expense of a small risk. In this sense, randomized algorithms may be used by the control engineer together with standard worst case methods to obtain additional useful information, The applicability of these probabilistic methods to robust control is presently limited by the fact that the sample generation is feasible only in very special cases which include systems affected by real parametric uncertainty bounded in rectangles or spheres, Sampling in more general uncertainty sets is generally performed through overbounding, at the expense of an exponential rejection rate. In this paper, randomized algorithms for stability and performance of linear time invariant uncertain systems described by a general M-Delta configuration are studied, In particular, efficient polynomial-time algorithms for uncertainty structures Delta consisting of an arbitrary number of full complex blocks and uncertain parameters are developed.

Keyword:

random matrices

randomized algorithms

robust control

uncertainty