Economic MPC of Wastewater Treatment Plants Based on Model Reduction
Bibliographic record
Abstract
In this paper, we consider the problem of economic model predictive control of wastewater treatment plants based on model reduction. We apply two model approximation methods to a wastewater treatment plant (WWTP) described by a modified Benchmark Simulation Model No.1 to overcome the intensive computation associated with economic model predictive control (MPC). Two computationally efficient models are obtained based on trajectory piecewise linearization (TPWL) and reduced order TPWL. To obtain the reduced order TPWL model, a proper orthogonal decomposition (POD)-based method is utilized. Further, the reduced order model is linearized to obtain a TPWL-POD model. The objective is to design controllers which minimize the overall economic cost. Accordingly, we design economic MPC (EMPC) controllers based on each of the models. The economic control cost can be described as a weighted summation of effluent quality and overall operating cost. We compare the accuracy of the two proposed approximation models with different linearization point numbers. We evaluate the average evaluation time for the two proposed EMPC controllers and make comparisons with the EMPC based on the original nonlinear model. We also investigate how the number of linearization points involved in the TPWL model and TPWL-POD model affects the control performance in terms of average performance cost and the average evaluation time.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".