Stochastic model predictive control framework for resilient cyber-physical systems: review and perspectives
Bibliographic record
Abstract
In the era of Industrial 4.0, the next-generation control system regards the cyber-physical system (CPS) as the core ingredient thanks to the comprehensive integration of physical systems, online computation, networking and control. A reliable, stable and resilient CPS should pledge robustness and safety. A significant concern in CPS development arises from security issues since the CPS is vulnerable to physical constraints, ubiquitous uncertainties and malicious cyber attacks. The integration of the stochastic model predictive control (MPC) framework and the resilient mechanism is a possible approach to guarantee robustness in the presence of stochastic uncertainties and enable resilience against cyber attacks. This review paper aims to offer a detailed overview of existing stochastic MPC algorithms and their CPS applications. More specifically, we first review existing stochastic MPC algorithms for both linear and nonlinear systems subject to probabilistic constraints. We then discuss how to extend the stochastic MPC framework to incorporate resilience mechanisms for constrained CPS under various malicious attacks. Finally, we present an architectural stochastic MPC-based framework for resilient CPS and identify future research challenges. This article is part of the theme issue 'Towards symbiotic autonomous systems'.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".