Novel adaptive fuzzy control for pendubot with actuator faults and uncertainties: Design and experiments
Bibliographic record
Abstract
Pendubot has been widely applied as a benchmark platform for control research and education. In this paper, a novel adaptive fuzzy hierarchical sliding mode controller (AFHSMC) is proposed for the pendubot under actuator faults and uncertainties. The proposed controller is designed by combining hierarchical sliding mode control (HSMC), fuzzy logic control (FLC), and balancing composite motion optimization. The proposed controller preserves many advantages such as having a straightforward structure, simple implementation, chattering reduction, and high precision and robustness. The stability of the proposed controller is ensured by using the Lyapunov approach. To verify the control performance, various numerical simulations and experiments are conducted on a pendubot under conditions that involve actuator faults and uncertainties. Compared to the conventional HSMC and FHSMC controllers, the proposed AFHSMC improves by 0.43% and 0.38% for tracking precision of the first link's angle estimate, 3.26% and 0.08% for the second link's angle estimate when influenced by uncertainties, as well as 65.23% and 12.24% for the first link, 83.95% and 16.15% for the second link when influenced by faults. • The proposed approach integrates HSMC and FLCs to tune the sliding gain and approximate uncertainties. • The BCMO method is proposed for optimizing the proposed controller, hence it is simple and easy to implement. • The proposed AHSMC controller offers advantages like simplicity, chatter-free operation, and high precision. • The proposed controller outperforms both HSMC and FHSMC in simulations and experiments on the pendubot.
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".