Adaptive-Robust Controller for Smart Exoskeleton Robot
Bibliographic record
Abstract
Rehabilitation robotics has seen growing popularity in recent years due to its immense potential for improving the lives of people with disabilities. However, the complex, uncertain dynamics of these systems present significant control challenges, requiring advanced techniques. This paper introduces a novel adaptive control framework integrating modified function approximation (MFAT) and double-integral non-singular terminal sliding mode control (DINTSMC). The goal is to achieve precise tracking performance, high robustness, a fast response, a finite convergence time, reduced chattering, and effective handling of unknown system dynamics. A key feature is the incorporation of a higher-order sliding mode observer, eliminating the need for velocity feedback. This provides a new solution for overcoming the inherent variations and uncertainties in robot manipulators, enabling improved accuracy within fixed convergence times. The efficacy of the proposed approach was validated through simulations and experiments on an exoskeleton robot. The results successfully demonstrated the controller's effectiveness. Stability analysis using Lyapunov theory proved the closed-loop system's uniform ultimate boundedness. This contribution is expected to enable enhanced control for rehabilitation robots and improved patient outcomes.
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.000 | 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.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".