Distributed nonlinear model predictive control for cobalt removal process in zinc hydrometallurgy considering error compensation modelling
Bibliographic record
Abstract
Abstract To address the strong nonlinearity, uncertainty, and mutual coupling in the cobalt removal process of zinc hydrometallurgy, an algorithm based on an improved genetic algorithm (GA) backpropagation (BP) neural network combined with distributed nonlinear model predictive control (NMPC) is proposed. This method was applied to improve the quality of the purification solution and reduce the consumption of zinc powder, overcoming the challenges faced by the current cobalt removal process. First, a synergistic continuously stirred tank reactor (SCSTR) model was constructed for the dynamic cobalt removal process. Second, aiming at the problem that a single SCSTR model has difficulty describing the process accurately, based on the highly nonlinear mapping ability of data‐driven models, a method that organically integrates the SCSTR model and an error compensation model based on the GA‐BP neural network was proposed (GA‐BP‐SCSTR) to provide a more accurate online prediction of the process indicators. Then, a distributed NMPC architecture was developed using the GA‐BP‐SCSTR model, control vector parameterization (CVP) technique, and sequential quadratic programming (SQP) algorithm to achieve the coordinated control of the cobalt removal process. Finally, simulation results of an actual site showed that the prediction accuracy of the GA‐BP‐SCSTR model was higher than those of other models. The proposed predictive control method can maintain the outlet cobalt ion concentrations at the set values while achieving accurate control of the zinc powder addition. This approach can provide guidance for on‐site production and eliminate the blindness of manual experience control.
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.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| 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".