Computing hard bounds for probabilistic robustness

F. Dabbene, C. Lagoa, R. Tempo

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

    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 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.
    Pages3210-3215
    Number of pages6
    ISBN (Print)1424401712, 9781424401710
    DOIs
    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)0191-2216

    Other

    Other45th IEEE Conference on Decision and Control 2006, CDC
    CountryUnited States
    CitySan Diego, CA
    Period12/13/0612/15/06

    All Science Journal Classification (ASJC) codes

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

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

    Cite this