The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
The Scenario Approach to Robust Control Design
Abstract
This paper proposes a new probabilistic solution framework for robust control analysis and synthesis problems that can be expressed in the form of minimization of a linear objective subject to convex constraints parameterized by uncertainty terms. This includes the wide class of NP-hard control problems representable by means of parameter-dependent linear matrix inequalities (LMIs). It is shown in this paper that by appropriate sampling of the constraints one obtains a standard convex optimization problem (the scenario problem) whose solution is approximately feasible for the original (usually infinite) set of constraints, i.e., the measure of the set of original constraints that are violated by the scenario solution rapidly decreases to zero as the number of samples is increased. We provide an explicit and efficient bound on the number of samples required to attain a-priori specified levels of probabilistic guarantee of robustness. A rich family of control problems which are in general hard to solve in a deterministically robust sense is therefore amenable to polynomial-time solution, if robustness is intended in the proposed risk-adjusted sense.
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
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
Optimal Control: Linear Quadratic Methods
Anderson, B. D. O., & Moore, J. B. (1979) · Cited by 2,823
Chance-Constrained Programming
Charnes, A., & Cooper, W. W. (1959) · Management Science · doi:10.1287/mnsc.6.1.73 · Cited by 2,742
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Global Optimization with Polynomials and the Problem of Moments
Lasserre, J. B. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623400366802 · Cited by 2,474
Learnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
Robust solutions of uncertain linear programs
Ben-Tal, A., & Nemirovski, A. (1999) · Operations Research Letters · doi:10.1016/s0167-6377(99)00016-4 · Cited by 1,829
Rugh, W. J., & Shamma, J. S. (2000) · Automatica · doi:10.1016/s0005-1098(00)00058-3 · Cited by 1,790
Prékopa, A. (1995) · Springer eBooks · doi:10.1007/978-94-017-3087-7 · Cited by 1,535
A new discrete-time robust stability condition
de Oliveira, M. C., Bernussou, J., & Geromel, J. C. (1999) · Systems & Control Letters · doi:10.1016/s0167-6911(99)00035-3 · Cited by 1,519
Robust Solutions to Least-Squares Problems with Uncertain Data
El Ghaoui, L., & Lebret, H. (1997) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896298130 · Cited by 1,076
Robust Solutions to Uncertain Semidefinite Programs
El Ghaoui, L., Oustry, F., & Lebret, H. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496305717 · Cited by 935
A Unified Algebraic Approach To Control Design
Grigoriadis, D. E. (2017) · Routledge eBooks · doi:10.1201/9781315136523 · Cited by 932
A survey of computational complexity results in systems and control
Blondel, V. D., & Tsitsiklis, J. N. (2000) · Automatica · doi:10.1016/s0005-1098(00)00050-9 · Cited by 732
Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
Ghaoui, L. E., Oks, M., & Oustry, F. (2003) · Operations Research · doi:10.1287/opre.51.4.543.16101 · Cited by 662
Uncertain convex programs: randomized solutions and confidence levels
Calafiore, G., & Campi, M. C. (2005) · Mathematical Programming · doi:10.1007/s10107-003-0499-y · Cited by 659
Self-citationRobust solution to least squares problems with uncertain data
Ghaoui, L. E., & Lebret, H. (1997) · Cited by 638
Robust Truss Topology Design via Semidefinite Programming
Ben-Tal, A., & Nemirovski, A. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495291951 · Cited by 378
A Theory of Learning and Generalization
Vidyasagar, M. (1997) · Cited by 337
Computational complexity of μ calculation
Braatz, R. P., Young, P. M., Doyle, J. C., & Morari, M. (1994) · IEEE Transactions on Automatic Control · doi:10.1109/9.284879 · Cited by 329
Several NP-hard problems arising in robust stability analysis
Nemirovskii, A. (1993) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf01211741 · Cited by 263
Sample compression, learnability, and the Vapnik-Chervonenkis dimension
Floyd, S., & Warmuth, M. (1995) · Machine Learning · doi:10.1007/bf00993593 · Cited by 256
Stochastic robustness of linear time-invariant control systems
Stengel, R. F., & Ryan, L. E. (1991) · IEEE Transactions on Automatic Control · doi:10.1109/9.62270 · Cited by 250
Randomized algorithms for robust controller synthesis using statistical learning theory
Vidyasagar, M. (2001) · Automatica · doi:10.1016/s0005-1098(01)00122-4 · Cited by 230
A monte carlo approach to the analysis of control system robustness
RAY, L. R., & Stengel, R. F. (1993) · Automatica · doi:10.1016/0005-1098(93)90187-x · Cited by 228
LPV Systems with parameter-varying time delays: analysis and control
Wu, F., & Grigoriadis, K. M. (2001) · Automatica · doi:10.1016/s0005-1098(00)00156-4 · Cited by 207
The uniform distribution: A rigorous justification for its use in robustness analysis
Barmish, B. R., & Lagoa, C. M. (1997) · Mathematics of Control Signals and Systems · doi:10.1007/bf01211503 · Cited by 207
On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
Ben-Tal, A., & Nemirovski, A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623400374756 · Cited by 166
Randomized algorithms for probabilistic robustness with real and complex structured uncertainty
Calafiore, G. C., Dabbene, F., & Tempo, R. (2000) · IEEE Transactions on Automatic Control · doi:10.1109/9.895560 · Cited by 159
Self-citationComputational complexity of µ calculation
Braatz, R. D., Young, P. M., Doyle, J. C., & Morari, M. (1993) · doi:10.1109/acc.1993.4176152 · Cited by 141
Stochastic algorithms for exact and approximate feasibility of robust LMIs
Calafiore, G. C., & Polyak, B. T. (2001) · IEEE Transactions on Automatic Control · doi:10.1109/9.964685 · Cited by 132
Self-citationImproved sample complexity estimates for statistical learning control of uncertain systems
Koltchinskii, V. I., Abdallah, C. T., Ariola, M., Dorato, P., & Panchenko, D. (2000) · IEEE Transactions on Automatic Control · doi:10.1109/9.895579 · Cited by 70
Probabilistic solutions to some NP-hard matrix problems
Vidyasagar, M., & Blondel, V. D. (2001) · Automatica · doi:10.1016/s0005-1098(01)00089-9 · Cited by 66
Cited by
Model predictive control: Recent developments and future promise
Mayne, D. Q. (2014) · Automatica · doi:10.1016/j.automatica.2014.10.128 · Cited by 1,975
Convex Approximations of Chance Constrained Programs
Nemirovski, A., & Shapiro, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050622328 · Cited by 1,160
(2013) · Dynamic Modelling and Predictive Control in Solid Oxide Fuel Cells: First Principle and Data‐Based Approaches · doi:10.1002/9781118501054.ch6 · Cited by 1,047
Stochastic Model Predictive Control: An Overview and Perspectives for Future Research
(2016) · IEEE Control Systems · doi:10.1109/mcs.2016.2602087 · Cited by 923
The 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
Self-citation
Metadata
- Authors
- Calafiore, G. C., & Campi, M. C.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2006-05
- Volume
- 51
- Issue
- 5
- Pages
- 742-753
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2167412190
- Cited by
- 1,150
- References
- 37
- FWCI
- 52.59
- 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
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.