On finite-horizon optimal control of first-order plus time delay 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
In this work, a finite-horizon optimal control problem for first-order plus time delay (FOPTD) processes is investigated. We show that if the control horizon is greater than three and the prediction horizon is great than the control horizon plus the time delay in discrete time, the optimal controller is not affected by either of the two parameters. Also, under these conditions, the controller parameters are explicitly calculated, the closed-loop system is shown to be stable, and the controller is dead-beat. The problem considered is related to the results on linear quadratic regulation of linear systems with time delays; however, the detailed parameterization of the state-space model introduced by the FOPTD process provides an additional opportunity to investigate the exact controller structure and properties (e.g., the locations of the closed-loop poles), which are also the major difficulties encountered and overcome in this work. This problem is motivated from phenomena experienced in designing industrial model predictive control (MPC) tuning algorithms, and extensive numerical examples indicate that the proposed results speed up the MPC autotuning algorithms by 70%.
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.000 | 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