Computing hard bounds for probabilistic robustness

F. Dabbene, C. Lagoa, R. Tempo

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 the 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.

Original languageEnglish (US)
Title of host publicationProceedings of the 45th IEEE Conference on Decision and Control 2006, CDC
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Print)1424401712, 9781424401710
StatePublished - 2006
Event45th IEEE Conference on Decision and Control 2006, CDC - San Diego, CA, United States
Duration: Dec 13 2006Dec 15 2006

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370


Other45th IEEE Conference on Decision and Control 2006, CDC
Country/TerritoryUnited States
CitySan Diego, CA

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization


Dive into the research topics of 'Computing hard bounds for probabilistic robustness'. Together they form a unique fingerprint.

Cite this