The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Stochastic Tubes in Model Predictive Control With Probabilistic Constraints
Abstract
Stochastic model predictive control (MPC) strategies can provide guarantees of stability and constraint satisfaction, but their online computation can be formidable. This difficulty is avoided in the current technical note through the use of tubes of fixed cross section and variable scaling. A model describing the evolution of predicted tube scalings facilitates the computation of stochastic tubes; furthermore this procedure can be performed offline. The resulting MPC scheme has a low online computational load even for long prediction horizons, thus allowing for performance improvements. The efficacy of the approach is illustrated by numerical examples.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Constrained model predictive control: Stability and optimality
Mayne, D. Q., Rawlings, J. B., Rao, C. V., & Scokaert, P. O. M. (2000) · Automatica · doi:10.1016/s0005-1098(99)00214-9 · Cited by 8,736
Cited by
Stochastic Model Predictive Control: An Overview and Perspectives for Future Research
(2016) · IEEE Control Systems · doi:10.1109/mcs.2016.2602087 · Cited by 923
Closed-Loop and Activity-Guided Optogenetic Control
Grosenick, L., Marshel, J. H., & Deisseroth, K. (2015) · Neuron · doi:10.1016/j.neuron.2015.03.034 · Cited by 380
Stochastic linear Model Predictive Control with chance constraints – A review
Farina, M., Giulioni, L., & Scattolini, R. (2016) · Journal of Process Control · doi:10.1016/j.jprocont.2016.03.005 · Cited by 342
Model Predictive Control — Status and Challenges
XI, Y.-G., LI, D.-W., & LIN, S. (2013) · Acta Automatica Sinica · doi:10.1016/s1874-1029(13)60024-5 · Cited by 291
Schildbach, G., Fagiano, L., Frei, C., & Morari, M. (2014) · Automatica · doi:10.1016/j.automatica.2014.10.035 · Cited by 275
Metadata
- Authors
- Cannon, M., Kouvaritakis, B., Rakovic, S. V., & Cheng, Q.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2011-01
- Volume
- 56
- Issue
- 1
- Pages
- 194-200
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2154067661
- Cited by
- 241
- References
- 1
- FWCI
- 15.93
- 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.