Dynamic Self-Triggered Robust Distributed Model Predictive Control for Coupled Nonlinear Systems
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
This article proposes a dynamic self-triggered distributed model predictive control algorithm for coupled nonlinear systems facing external disturbances and constraints on state and input variables. A dynamic self-triggered mechanism that combines the advantages of event-triggered and self-triggered strategies is designed to simultaneously reduce the frequencies of both sampling and solving optimization problems. Particularly, the triggering threshold is adaptively adjusted using a dynamic variable, which can effectively balance control performance and computational resources. Furthermore, through the construction of a two-model optimal control problem and the analysis of input-to-state practical stability for the overall system, a single-mode distributed model predictive control framework is established for each subsystem within the proposed algorithm, which enables a fully distributed implementation. Sufficient conditions for recursive feasibility and robust stability are investigated, and conservatism is reduced by eliminating the requirement for the system state to reach the terminal region in finite time. Finally, the effectiveness of the developed algorithm is validated through two numerical examples with comparisons.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 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