2004
DOI: 10.1137/s0363012902409234
|View full text |Cite
|
Sign up to set email alerts
|

Fast Construction of Robustness Degradation Function

Abstract: We develop a fast algorithm to construct the robustness degradation function, which describes quantitatively the relationship between the proportion of systems guaranteeing the robustness requirement and the radius of the uncertainty set. This function can be applied to predict whether a controller design based on an inexact mathematical model will perform satisfactorily when implemented on the true system.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2004
2004
2011
2011

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 15 publications
(22 citation statements)
references
References 23 publications
0
22
0
Order By: Relevance
“…It can be verified that r i r i+1 = 1 − 1 m−1 λ−1 +i for i = 1, 2, · · · , m − 1. Let n k be the total number of simulations on the direction associated with directional sample U k , k = 1, 2, · · · , N. Applying Theorem 1 of [5] and Theorem 5 in this paper to a sample reuse process conditioned upon a direction with grid points r 1 , r 2 , · · · , r m and sample size N = 1,…”
Section: Lemma 14 For Any Continuous Intervalmentioning
confidence: 99%
See 3 more Smart Citations
“…It can be verified that r i r i+1 = 1 − 1 m−1 λ−1 +i for i = 1, 2, · · · , m − 1. Let n k be the total number of simulations on the direction associated with directional sample U k , k = 1, 2, · · · , N. Applying Theorem 1 of [5] and Theorem 5 in this paper to a sample reuse process conditioned upon a direction with grid points r 1 , r 2 , · · · , r m and sample size N = 1,…”
Section: Lemma 14 For Any Continuous Intervalmentioning
confidence: 99%
“…From another perspective, it also shows that the number of grid points and computational complexity tend to infinity as the tolerance tends to zero. The computational complexity can be reduced by the sample reuse techniques of [5]. It is recently shown in [13] that the equivalent number of grid points is bounded by 1 + d ln λ (see Appendix C for a proof).…”
Section: Computational Complexitymentioning
confidence: 99%
See 2 more Smart Citations
“…Significant contributions have been made by a number of researchers (see, e.g., [1,2,3,4,5], [10,11,12,13,14,15,16,17] and the reference therein). A fundamental problem in the area of probabilistic robustness analysis is to estimate the probability that a certain robustness requirement is guaranteed for an uncertain dynamic system.…”
Section: Introductionmentioning
confidence: 99%