Automatic tuning of robust constrained cross‐direction controllers
Bibliographic record
Abstract
Summary The paper machine cross‐directional (CD) process is a large‐scale spatially distributed system. It is known to be severely ill‐conditioned as the gain rolls down to zero for some of the process directions. Model uncertainties in the process are inevitable resulting in a challenging robust control design problem. CD actuators are subject to min–max constraints while slice lip actuators are subject to additional bending moment limits. Because of the large number of input constraints, the industrial practice is to tune the CD controller assuming inactive constraints. The robustness of CD feedback loops to model uncertainties under constrained internal model control satisfies an integral quadratic inequality. This work develops an automatic tuning algorithm that guarantees robust stability and performance of the constrained CD feedback loop. Spatial response models are identified in a prediction error frame delivering bounds on the CD process pseudo‐singular values. The CD controller is synthesized online through a linear matrix inequalities feasibility problem taking into consideration the modal space uncertainty rising from the uncertainties in the estimated parameters and the expected variations in the dynamic response. The developed tuning technique is suitable for paper machines producing different grades of paper as the CD process spatial and dynamic responses change for each grade. The performance of the tuned constrained internal model control controller is validated through comparing it to an industrial CD controller that has been implemented in paper mills as part of a commercial product. Copyright © 2015 John Wiley & Sons, Ltd.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 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.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".