DocumentCode
2478466
Title
Computing Hard Bounds for Probabilistic Robustness
Author
Dabbene, F. ; Lagoa, C. ; Tempo, R.
Author_Institution
IEIIT-CNR, Politecnico di Torino
fYear
2006
fDate
13-15 Dec. 2006
Firstpage
3210
Lastpage
3215
Abstract
In this paper, the problem of estimating the probability of performance is addressed. In contrast to previous results in the area of probabilistic robustness, we present an algorithm providing "hard" deterministic upper and lower bounds on this probability. Emphasis is put on the probability of stability of polynomials whose coefficients are multiaffine functions of the uncertainty. The proposed algorithm is illustrated via numerical examples
Keywords
computational complexity; polynomials; probability; robust control; uncertain systems; hard bounds; multiaffine functions; numerical examples; polynomials stability; probabilistic robustness; Poles and zeros; Polynomials; Random variables; Robust control; Robustness; Stability; USA Councils; Uncertain systems; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2006 45th IEEE Conference on
Conference_Location
San Diego, CA
Print_ISBN
1-4244-0171-2
Type
conf
DOI
10.1109/CDC.2006.377320
Filename
4177753
Link To Document