Gain-Scheduled Sliding-Mode-Type Iterative Learning Control Design for Mechanical Systems
Bibliographic record
Abstract
In this paper, a novel gain-scheduled sliding-mode-type (SM-type) iterative learning (IL) control approach is proposed for the high-precision trajectory tracking of mechanical systems subject to model uncertainties and disturbances. Based on the SM variable, the proposed controller is synthesized involving a feedback regulation item, a feedforward learning item, and a robust switching item. The feedback regulation item is adopted to regulate the position and velocity tracking errors, the feedforward learning item is applied to handle the model uncertainties and repetitive disturbance, and the robust switching item is introduced to compensate the nonrepetitive disturbance and linearization residual error. Moreover, the gain-scheduled mechanism is employed for both the feedback regulation item and feedforward learning item to enhance the convergence speed. Convergence analysis illustrates that the position and velocity tracking errors can eventually regulate to zero under the proposed controller. By combining the advantages of both SM control and IL control, the proposed controller has strong robustness against model uncertainties and disturbances. Lastly, simulations and comparisons are provided to evaluate the efficiency and excellent performance of the proposed control approach.
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.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".