The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Randomized algorithms for probabilistic robustness with real and complex structured uncertainty
Abstract
There has been a growing interest in developing randomized algorithms for probabilistic robustness of uncertain control systems. Unlike classical worst case methods, these algorithms provide probabilistic estimates assessing, for instance, if a certain design specification is met with a given probability. One of the advantages of this approach is that the robustness margins can be often increased by a considerable amount, at the expense of a small risk. In this sense, randomized algorithms may be used by the control engineer together with standard worst case methods to obtain additional useful information. The applicability of these probabilistic methods to robust control is presently limited by the fact that the sample generation is feasible only in very special cases which include systems affected by real parametric uncertainty bounded in rectangles or spheres. Sampling in more general uncertainty sets is generally performed through overbounding, at the expense of an exponential rejection rate. In the paper, randomized algorithms for stability and performance of linear time invariant uncertain systems described by a general M-/spl Delta/ configuration are studied. In particular, efficient polynomial-time algorithms for uncertainty structures /spl Delta/ consisting of an arbitrary number of full complex blocks and uncertain parameters are developed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Simulation and the Monte Carlo Method
Rubinstein, R. Y., & Kroese, D. P. (2016) · Wiley Series in Probability and Statistics · doi:10.1002/9781118631980 · Cited by 3,356 · cited 2×
“Among these techniques we recall the classical inversion method [17], [ 34 ].”
Method
Cited by
The Scenario Approach to Robust Control Design
Calafiore, G. C., & Campi, M. C. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.875041 · Cited by 1,150
Self-citationThe Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Campi, M. C., & Garatti, S. (2008) · SIAM Journal on Optimization · doi:10.1137/07069821x · Cited by 560
A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality
Campi, M. C., & Garatti, S. (2011) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9754-6 · Cited by 398
The scenario approach for systems and control design
Campi, M. C., Garatti, S., & Prandini, M. (2009) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2009.07.001 · Cited by 367
Robustness analysis of biochemical network models
Kim, J., Bates, D. G., Postlethwaite, I., Ma, L., & Iglesias, P. A. (2006) · IEE Proceedings - Systems Biology · doi:10.1049/ip-syb:20050024 · Cited by 89
Metadata
- Authors
- Calafiore, G. C., Dabbene, F., & Tempo, R.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2000
- Volume
- 45
- Issue
- 12
- Pages
- 2218-2235
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W1994382933
- Cited by
- 159
- References
- 1
- FWCI
- 26.19
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Randomized algorithms for probabilistic robustness with real and complex structured uncertainty. https://app.cochat.ai/papers/10.1109/9.895560
- The paper
- Calafiore, G. C., Dabbene, F., & Tempo, R. (2000). Randomized algorithms for probabilistic robustness with real and complex structured uncertainty. IEEE Transactions on Automatic Control. https://doi.org/10.1109/9.895560
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.