Closed-Loop Prediction for Robust and Stabilizing Optimization and Control
Bibliographic record
Abstract
The control and optimization of chemical plants is a major area of research as it has the potential to improve both economic output and plant safety. It is often prudent to separate control and optimization tasks of varying complexities and time scales, creating a hierarchical control structure. Within this structure, it is beneficial for one control layer to be able to account for the effects of other layers. A clear example of this, and the basis of this work, is closed-loop dynamic real-time optimization (CL-DRTO), in which an economic optimization method considers both the plant behavior and the effects of an underlying model predictive controller (MPC). This technique can be expanded on to allow its use and methods to be employed in a greater diversity of applications, particularly unstable and uncertain plant environments. First, this work seeks to improve on existing robust MPC techniques, which incorporate plant uncertainty via direct multi-scenario modelling, by also including future MPC behavior through the use of the CL modelling technique of CL-DRTO. This allows the CL robust MPC to account for how future MPC executions will be affected by uncertain plant behavior. Second, Lyapunov MPC (LMPC) is a generally nonconvex technique which focuses on effective control of plants which exhibit open-loop unstable behavior. A new convex LMPC formulation is presented here which can be readily embedded into a CL-DRTO scheme. Next, uncertainty handling is incorporated directly into a CL-DRTO via a robust multi-scenario method to allow for the economic optimization to take uncertain plant behavior into account while also modelling MPC behavior under plant uncertainty. Finally, the robust CL-DRTO method is computationally expensive, so a decomposition method which separates the robust CL-DRTO into its respective scenario subproblems is developed to improve computation time, especially for large optimization problems.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.002 |
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".