Computing hard bounds for probabilistic robustness

F. Dabbene; C. Lagoa; R. Tempo

doi:10.1109/cdc.2006.377320

Computing hard bounds for probabilistic robustness

F. Dabbene, C. Lagoa, R. Tempo

Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	3210-3215
Number of pages	6
ISBN (Print)	1424401712, 9781424401710
DOIs	https://doi.org/10.1109/cdc.2006.377320
State	Published - 2006
Event	45th IEEE Conference on Decision and Control 2006, CDC - San Diego, CA, United States Duration: Dec 13 2006 → Dec 15 2006

Publication series

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

Other

Other	45th IEEE Conference on Decision and Control 2006, CDC
Country/Territory	United States
City	San Diego, CA
Period	12/13/06 → 12/15/06

All Science Journal Classification (ASJC) codes

Control and Systems Engineering
Modeling and Simulation
Control and Optimization

Access to Document

10.1109/cdc.2006.377320

Cite this

@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",

doi = "10.1109/cdc.2006.377320",

language = "English (US)",

isbn = "1424401712",

series = "Proceedings of the IEEE Conference on Decision and Control",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "3210--3215",

booktitle = "Proceedings of the 45th IEEE Conference on Decision and Control 2006, CDC",

address = "United States",

note = "45th IEEE Conference on Decision and Control 2006, CDC ; Conference date: 13-12-2006 Through 15-12-2006",

}

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, Institute of Electrical and Electronics Engineers Inc., pp. 3210-3215, 45th IEEE Conference on Decision and Control 2006, CDC, San Diego, CA, United States, 12/13/06. https://doi.org/10.1109/cdc.2006.377320

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Computing hard bounds for probabilistic robustness

AU - Dabbene, F.

AU - Lagoa, C.

AU - Tempo, R.

PY - 2006

Y1 - 2006

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

U2 - 10.1109/cdc.2006.377320

DO - 10.1109/cdc.2006.377320

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

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 45th IEEE Conference on Decision and Control 2006, CDC

Y2 - 13 December 2006 through 15 December 2006

ER -

Computing hard bounds for probabilistic robustness

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this