A multi‐priority hierarchical optimization method for double‐layer model predictive control
Bibliographic record
Abstract
Abstract Considering the demand for the sequential regulation of manipulated variables in actual industrial process control, the conventional solution of double‐layer model predictive control faces the problem that the weight coefficients are difficult to tune. This paper proposes an improved hierarchical optimization method for manipulated variables in the steady‐state optimization layer of double‐layer model predictive control. The proposed method can adjust the manipulated variables sequentially without an accurate weight coefficient to avoid difficulty in tuning the weight coefficients. The relation between the optimal solution and the feasible region of the steady‐state optimization layer is analysed to describe the reoptimization of the key manipulated variables. The impact of the economic cost coefficient on the optimal solution with the sensitivity analysis method is studied, and the complexity of using the weight coefficient to solve the priority optimization problem of the manipulated variables is assessed. The steady‐state optimization solution procedure is improved based on the theory of the multiobjective complete hierarchical method. The hierarchical and sequential optimization of the manipulated variables results in expanding the space and freedom of the key manipulated variables, increasing efficiency, reducing consumption, and improving economic performance. The improved hierarchical optimization method is direct and simple in achieving optimization sequentially and satisfies the need for adjusting the manipulated variables according to human intentions.
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.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| 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.003 | 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".