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
    Pages3210-3215
    Number of pages6
    StatePublished - Dec 1 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

    Fingerprint

    Robustness
    Computing
    Upper and Lower Bounds
    Polynomials
    Uncertainty
    Numerical Examples
    Polynomial
    Coefficient

    All Science Journal Classification (ASJC) codes

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

    Cite this

    Dabbene, F., Lagoa, C., & Tempo, R. (2006). Computing hard bounds for probabilistic robustness. In Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC (pp. 3210-3215). [4177753] (Proceedings of the IEEE Conference on Decision and Control).
    Dabbene, F. ; Lagoa, C. ; Tempo, R. / Computing hard bounds for probabilistic robustness. Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC. 2006. pp. 3210-3215 (Proceedings of the IEEE Conference on Decision and Control).
    @inproceedings{742972c00c364d718e4b6f132447f422,
    title = "Computing hard bounds for probabilistic robustness",
    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.",
    author = "F. Dabbene and C. Lagoa and R. Tempo",
    year = "2006",
    month = "12",
    day = "1",
    language = "English (US)",
    isbn = "1424401712",
    series = "Proceedings of the IEEE Conference on Decision and Control",
    pages = "3210--3215",
    booktitle = "Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC",

    }

    Dabbene, F, Lagoa, C & Tempo, R 2006, Computing hard bounds for probabilistic robustness. in Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC., 4177753, Proceedings of the IEEE Conference on Decision and Control, pp. 3210-3215, 45th IEEE Conference on Decision and Control 2006, CDC, San Diego, CA, United States, 12/13/06.

    Computing hard bounds for probabilistic robustness. / Dabbene, F.; Lagoa, C.; Tempo, R.

    Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC. 2006. p. 3210-3215 4177753 (Proceedings of the IEEE Conference on Decision and Control).

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

    TY - GEN

    T1 - Computing hard bounds for probabilistic robustness

    AU - Dabbene, F.

    AU - Lagoa, C.

    AU - Tempo, R.

    PY - 2006/12/1

    Y1 - 2006/12/1

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

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

    UR - http://www.scopus.com/inward/record.url?scp=39649111056&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=39649111056&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:39649111056

    SN - 1424401712

    SN - 9781424401710

    T3 - Proceedings of the IEEE Conference on Decision and Control

    SP - 3210

    EP - 3215

    BT - Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC

    ER -

    Dabbene F, Lagoa C, Tempo R. Computing hard bounds for probabilistic robustness. In Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC. 2006. p. 3210-3215. 4177753. (Proceedings of the IEEE Conference on Decision and Control).