Multistage Suboptimal Model Predictive Control With Improved Computational Efficiency
Bibliographic record
Abstract
This paper proposes a multistage suboptimal model predictive control (MPC) strategy which can reduce the prediction horizon without compromising the stability property. The proposed multistage MPC requires a precomputed sequence of j-step admissible sets, where the j-step admissible set is the set of system states that can be steered to the maximum positively invariant set in j control steps. Given the precomputed admissible sets, multistage MPC first determines the minimum number of steps M required to drive the state to the terminal set. Then, it steers the state to the (M – N)-step admissible set if M > N, or to the terminal set otherwise. The paper presents the offline computation of the admissible sets, and shows the feasibility and stability of multistage MPC for systems with and without disturbances. A numerical example illustrates that multistage MPC with N = 5 can be used to stabilize a system which requires MPC with N ≥ 14 in the absence of disturbances, and requires MPC with N ≥ 22 when affected by disturbances.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
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".