State and Parameter Estimation in Closed-Loop Dynamic Real-Time Optimization
Bibliographic record
Abstract
To adapt to overarching objectives and changing demands, a plant automation system capable of real-time optimization and dynamic model predictions is desirable. Dynamic real-time optimization (DRTO) can achieve higher level objectives such as profitability, however RTO and DRTO schemes require a mechanism to utilize plant measurements to adapt the model to reflect changing conditions. This study proposes a novel integration of Kalman filter state and parameter estimation in which the impact of the controller and the plant response is accounted for in the DRTO. This closed-loop DRTO (CL-DRTO) approach is used to control a multi-input multi-output CSTR where a critical parameter is not measurable. The CSTR is optimized under economic and target tracking objectives, and is tested using two different control layers, PI-based and MPC-based. In the PI controlled CSTR, the proposed solution was compared to the ideal case of full state feedback and a common approach to dealing with mismatch: bias updating. The proposed Kalman filter estimator effectively handles noise and infeasible targets, surpassing bias updating in scenarios involving input saturation and increased measurement noise. The PI controlled CSTR is also tested with nonlinear models and an extended Kalman filter, demonstrating a method for controlling even highly nonlinear systems. In the MPC controlled CSTR, the Kalman filter is tested under input saturation and various disturbance sources. By using DRTO setpoints to guide the MPC towards targets, inputs can be maintained at their constrained bounds without directly accounting for these constraints in the MPC formulation or clipping the inputs directly. Under every scenario tested, the Kalman filter successfully estimated the unknown parameter and demonstrated excellent robustness. The proposed strategy’s ability to control nonlinear plants using linear models suggests potential scalability for larger, more complex 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.
How this classification was reachedexpand
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.004 | 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 teacher head, 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".