Data-Driven Dynamic Internal Model Control
Bibliographic record
Abstract
A data-driven dynamic internal model control (D3IMC) scheme is proposed for unknown nonlinear nonaffine systems bypassing modeling steps. Different from the traditional internal model constructed by either a first-principle or an identified model, a dynamic internal model (DIM) is developed in this work using I/O data where a compact form dynamic linearization approach is introduced for addressing the nonlinearity and nonaffine structure. Then, the D3IMC is proposed with both a nominal control algorithm and an uncertainty compensation control algorithm. The former can quickly respond to the feedback errors and the latter can compensate the model-plant mismatch and external disturbances. Meanwhile, the adaptive parameter updating law in the proposed D3IMC method inherits the robustness against uncertainties. A nominal D3IMC is also designed without including the compensator when there is no exogenous disturbance since the adaptive mechanism can handle system uncertainty. Further, the results are extended and a full-form dynamic linearization-based D3IMC is developed to address control of nonlinear systems with more complex dynamics. All the proposed D3IMC methods are data-driven without need of an explicit model, and thus they are significant extensions from the traditional model-based IMC. Simulation study verifies the results.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".