A Combined Multiple Model Adaptive Control Scheme and Its Application to Nonlinear Systems With Nonlinear Parameterization
Bibliographic record
Abstract
A combined multiple model adaptive control (CMMAC) scheme, which is a proper combination of the estimator-based MMAC scheme and the unfalsified MMAC scheme, has been proposed with the aim of taking advantage of the strength of each scheme while avoiding their weaknesses. The major novelty of the CMMAC scheme lies in the fact that it monitors not only the adequacy of candidate models in terms of their estimation performances but also the performance of the active candidate controller. As an application of the CMMAC scheme and one example of such new multiple model adaptive controllers, a CMMAC based controller has been designed for a class of nonlinear systems with nonlinear parameterization. Under some sufficient conditions, a strong finite time switching result (which provides a characterization on the maximum number of switching) and the closed-loop stability have been established. A constructive design based on back-stepping is provided for the adaptive control problem of a special class of nonlinearly parameterized systems, which can satisfy all the sufficient conditions to ensure closed-loop stability.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| 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".