The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Distributionally Robust Optimization Based Method for Stochastic Model Predictive Control
Abstract
Two stochastic model predictive control algorithms, which are referred to as distributionally robust model predictive control algorithms, are proposed in this article for a class of discrete linear systems with unbounded noise. Participially, chance constraints are imposed on both of the state and the control, which makes the problem more challenging. Inspired by the ideas from distributionally robust optimization (DRO), two deterministic convex reformulations are proposed for tackling the chance constraints. Rigorous computational complexity analysis is carried out to compare the two proposed algorithms with the existing methods. Recursive feasibility and convergence are proven. Simulation results are provided to show the effectiveness of the proposed algorithms.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Although these models are highly optimised on the training data set using [61,62], user acceptability remains under question.”
From Interpreting Black-Box Models: A Review on Explainable Artificial Intelligence (2024) · cites this paper as [61]
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 1×
“Since E [ P ] { w t + k } = 0 n w ,then the expectation of system (8) is System (16) can also be rewritten into the following compact form: Terminal constraints are known to be closely related to the system stability [30].”
Background
Research works printed but not linked: 37
- 10.1016/j.automatica.2004.08.019 · DOI
- 10.1002/rnc.815 · DOI
- 10.3166/ejc.15.5-21 · DOI
- 10.1016/j.jprocont.2016.03.005 · DOI
- 10.1016/j.automatica.2015.02.039 · DOI
- 10.1016/j.automatica.2016.04.008 · DOI
- 10.1109/TAC.2012.2203054 · DOI
- 10.1016/j.automatica.2008.06.017 · DOI
- 10.1109/TAC.2010.2086553 · DOI
- 10.1016/j.sysconle.2011.12.002 · DOI
- 10.1109/ACC.2012.6315201 · DOI
- 10.1109/TAC.2016.2612822 · DOI
- 10.1016/j.automatica.2015.07.025 · DOI
- 10.1002/rnc.4024 · DOI
- 10.1016/j.automatica.2013.03.010 · DOI
- 10.1016/j.automatica.2010.06.034 · DOI
- 10.1109/TAC.2014.2310066 · DOI
- 10.1137/050622328 · DOI
- 10.1287/mnsc.32.11.1445 · DOI
- 10.1007/978-1-4757-6594-6_17 · DOI
- 10.1109/TAC.2015.2444134 · DOI
- 10.1007/s10107-011-0494-7 · DOI
- 10.1016/S0024-3795(98)10032-0 · DOI
- 10.1017/CBO9780511804441 · DOI · Paper page
- 10.1137/S1052623401383236 · DOI
- 10.1007/s10957-006-9084-x · DOI
- 10.1016/j.ifacol.2020.12.521 · DOI
- 10.1109/CDC.2009.5399951 · DOI
- 10.1016/j.automatica.2012.06.053 · DOI
- 10.1109/CDC.2013.6761117 · DOI
- 10.1080/00207179.2017.1323351 · DOI
- 10.1109/CDC.2018.8619554 · DOI
- 10.1007/s10479-015-2039-6 · DOI
- Herirung, 2017, Stochastic model predictive control - How does it work, Comput. Chem. Eng., 13, 5932
- 10.1002/rnc.1249 · DOI
- 10.1109/TAC.2016.2625048 · DOI
- 10.1109/78.887045 · DOI
Cited by
Sorted by citations
Interpreting Black-Box Models: A Review on Explainable Artificial Intelligence
Hassija, V., Chamola, V., Mahapatra, A., Singal, A., Goel, D., Huang, K., Scardapane, S., Spinelli, I., Mahmud, M., & Hussain, A. (2024) · Cognitive Computation · doi:10.1007/s12559-023-10179-8 · Cited by 2,495
“Although these models are highly optimised on the training data set using [61, 62], user acceptability remains under question.”
Background
Metadata
- Authors
- Li, B., Tan, Y., Wu, A.-G., & Duan, G.-R.
- Affiliations
- Sichuan University (CN)
- Southeast University (CN)
- Harbin Institute of Technology (CN)
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2022-11
- Volume
- 67
- Issue
- 11
- Pages
- 5762-5776
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W3209358401
- Cited by
- 156
- References
- 1
- Citations by year
- 2026: 24 · 2025: 30 · 2024: 27 · 2023: 71 · 2022: 4
- FWCI
- 11.35
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Automatic Control (publishedVersion)
- Funders
- National Natural Science Foundation of China (62071317)
- National Natural Science Foundation of China for Excellent Young Scholars (61822305)
- Science and Technology on Space Intelligent Control Laboratory (KGJZDSYS-2018-03)
- Natural Science Foundation of Guangdong Province (2019A1515011576)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
- Social Sciences › Decision Sciences › Management Science and Operations Research › Risk and Portfolio Optimization
- Physical Sciences › Engineering › Control and Systems Engineering › Stability and Control of Uncertain Systems
- Keywords
- stochastic model predictive control, distributionally robust optimization, chance constraints, discrete-time linear systems, convex reformulation, complexity analysis, recursive feasibility, convergence analysis
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