Robust Sliding Mode Control for Robot Manipulators
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In the face of large-scale parametric uncertainties, the single-model (SM)-based sliding mode control (SMC) approach demands high gains for the observer, controller, and adaptation to achieve satisfactory tracking performance. The main practical problem of having high-gain-based design is that it amplifies the input and output disturbance as well as excites hidden unmodeled dynamics, causing poor tracking performance. In this paper, a multiple model/control-based SMC technique is proposed to reduce the level of parametric uncertainty to reduce observer-controller gains. To this end, we split uniformly the compact set of unknown parameters into a finite number of smaller compact subsets. Then, we design a candidate SMC corresponding to each of these smaller subsets. The derivative of the Lyapunov function candidate is used as a resetting criterion to identify a candidate model that approximates closely the plant at each instant of time. The key idea is to allow the parameter estimate of conventional adaptive sliding mode control design to be reset into a model that best estimates the plant among a finite set of candidate models. The proposed method is evaluated on a 2-DOF robot manipulator 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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it