A hybrid adaptive control approach for robust tracking of robotic manipulators: theory and experiment
Bibliographic record
Abstract
SUMMARY In this work, a novel hybrid control strategy is proposed for robust trajectory tracking control of robotic systems. The main interest of using hybrid design is to reduce the controller gains so as to reduce control efforts from the single model certainty equivalence principle- based adaptive controllers. For this purpose, we allow the parameter estimate of conventional adaptive control design to be switched into a model that best approximates the plant among a finite set of models. First, we uniformly divide the compact set of unknown parameters into a finite number of smaller compact subsets. Then we construct a finite set of candidate controller for each of these smaller compact subsets. The derivative of the Lyapunov function candidate is employed to identify a controller that closely approximates the plant at each instant of time. The idea of introducing hybrid approach in adaptive control framework is to achieve good transient tracking performance with smaller values of controller gains in the presence of large-scale parametric uncertainties. The proposed method is implemented and evaluated on two 3 degree-of-freedom Phantom Premimum™ 1.5 telerobotic systems to demonstrate the effectiveness of the theoretical development.
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.000 | 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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".