HD-MPC: hierarchical distributed model predictive control for the great lakes flow network optimization
Bibliographic record
Abstract
With the rapid development of smart city construction, smart water resource management, as an important part of urban infrastructure optimization, is in dire need of efficient and adaptive control techniques to meet the challenges of complex dynamic systems. In this study, a hierarchical distributed model predictive control (HD-MPC) system based on Alternating Direction Multiplier Method (ADMM) coordination is proposed for the Great Lakes, an important water network spanning the U.S.-Canada border, in conjunction with the need for multi-source data fusion and distributed intelligent decision making in smart cities. The system solves the multiple-input multiple-output (MIMO) water level regulation problem in the Great Lakes flow network by integrating multi-objective optimization and dynamic feedback mechanisms. By integrating hydrologic, climate, and stakeholder demand data, an optimization model based on genetic algorithm and hierarchical analysis (GA-AHP) was constructed, and ADMM was used to achieve distributed collaborative control. Simulations based on 2012-2022 historical data show that HD-MPC can effectively stabilize water level and adapt to extreme climate, providing theoretical support and technical reference for the dynamic optimization of large-scale water resource systems in smart cities.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 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.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".