Decentralized control design using Integrator Backstepping for controlling web winding systems
Bibliographic record
Abstract
Many types of materials are manufactured or processed in the form of a sheet or a web (textile, paper, metal, etc.), which then couples the processing rolls and the associated motor drives. In Winding and web transport systems, the main concern is to control independently speed and tension in spite of disturbances such as radius variations and changes of set point, and to the coupling introduced by the elastic web. So the increasing requirement on the control performance led to investigation for sophisticated control strategies. To improve the overall performance of the winding system, we propose to apply decentralized control based an Integrator Backstepping strategy for controlling web winding systems. The advantage of this type of control is to impose stability properties by building recursively a Lyapunov function for the overall cascade system. Our winding system is simulated in Matlab®/Simulink™ environment, the results obtained illustrate the efficiency of the proposed control, with no overshoot, and the rising time is improved with good disturbance rejection comparing with the classical control law (PI controller).
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| 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".