Enhanced data-driven optimal iterative learning control for nonlinear non-affine discrete-time systems with iterative sliding-mode surface
Bibliographic record
Abstract
In this work, an enhanced data-driven optimal iterative learning control (eDDOILC) is proposed for nonlinear nonaffine systems where a new iterative sliding mode surface (ISMS) is designed to replace the traditional tracking error in the controller design and analysis. It is the first time to extend the sliding mode surface to the iteration domain for systems operate repetitively over a finite time interval. By virtual of the new designed ISMS, the control design becomes more flexible where both the time and the iteration dynamics can be taken into account. Before proceeding to the controller design, an iterative dynamic linear data model is built between two consecutive iterations to formulate the linear input-output data relationship of the repetitive nonlinear nonaffine discrete-time system. The linear data model is virtual and does not have any physical meanings, which is very different to the traditional mechanism mathematical model. In the sequel, the eDDOILC is proposed by designing an objective function with respect to the proposed two-dimensional ISMS. Rigorous proof is provided to show the convergence of the proposed eDDOILC method. Furthermore, the results have been extended to a multiple-input multiple-output (MIMO) nonaffine nonlinear discrete-time repetitive system. In general, the proposed eDDOILC is data-driven where no explicit model information is included. It is illustrated that the presented eDDOILC is effective when applied to the nonlinear nonaffine uncertain systems.
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.001 |
| 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.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".