Observer-Based Sampled-Data Model-Free Adaptive Control for Continuous-Time Nonlinear Nonaffine Systems With Input Rate Constraints
Bibliographic record
Abstract
A sampled-data model-free adaptive control (SMFAC) strategy is proposed for continuous-time nonlinear nonaffine systems with input rate constraints. By using differential and integral mean value theorems as two basic mathematic tools, a sampled-data local dynamic linearization method is proposed at first to transform the continuous-time nonlinear nonaffine model into a sampled-data nonlinear affine I/O model, including a linear parametric term affined to the control input and a nonlinear uncertainty term. On this basis, we consequently propose an observer-based SMFAC (ObSMFAC) scheme, including a sampled-data parameter estimator to estimate the unknown partial derivatives and a sampled-data observer to estimate the residual nonlinear uncertainty, respectively. Note that the sampling period is incorporated explicitly in the proposed ObSMFAC which enhances the control performance by reducing its negative influence on the system stability. The constraint on the input rate is also considered in the control law as the transition condition of the input updating algorithms. The convergence of the proposed ObSMFAC is proved by using the contraction mapping principle. The simulation study demonstrates the theoretical 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.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".