A design technique for fast sampled-data nonlinear model predictive control with convergence and stability results
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this study, a sampled-data nonlinear model predictive control scheme is developed. The control algorithm uses a prediction horizon with variable length, a terminal constraint set, and a feedback controller defined on this set. Following a suboptimal solution strategy, a defined number of steps of an iterative optimisation routine improve the current input trajectory at each sampling point. The value of the objective function monotonically decreases and the state converges to a target set. A discrete-time formulation of the algorithm and a discrete-time design model ensure high computational efficiency and avoid an ad hoc quasi-continuous implementation. This design technique for a fast sampled-data nonlinear model predictive control algorithm is the main contribution of the paper. Based on a benchmark control problem, the performance of the developed control algorithm is assessed against state-of-the-art nonlinear model predictive control methods available in the literature. This assessment demonstrates that the developed control algorithm stabilises the system with very low computational effort. Hence, the algorithm is suitable for real-time control of fast dynamical 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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it