A novel <scp>PID</scp> type iterative learning controller optimized by two‐dimensional infinite horizon linear quadratic iterative learning control for batch processes
Bibliographic record
Abstract
Abstract Although a proportional integral derivative type iterative learning control (PIDILC) scheme can achieve good performance, its application is limited by open‐loop structure, parameter tuning, and initial state. In this paper, a novel PIDILC optimized by two‐dimensional infinite horizon linear quadratic regulator (PIDILC‐2D‐IHLQR) is proposed. First, by synthesizing the advantage of the conventional PIDILC method and proportional integral derivative (PID) strategy, a novel closed‐loop PIDILC scheme is obtained. Then, a novel two‐dimensional infinite horizon linear quadratic regulator (2D‐IHLQR) is developed to optimize the parameters of the PIDILC strategy. The limitations of parameter tuning and initial state are solved by this PIDILC‐2D‐IHLQR method. Therefore, the proposed method not only solves the aforementioned limitations but also inherits the advantages of PIDILC algorithm, PID method, and the novel 2D‐IHLQR scheme. Moreover, a stability condition is given based on Lyapunov theory and it can help judge whether the selection of control parameters meets the stability condition. The effectiveness of the proposed method is demonstrated by the case study on an injection modelling process.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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.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".