Adaptive Robust Tracking Control of Robotic Manipulator based on SMC and Fuzzy Control Strategy
Bibliographic record
Abstract
In recent years, robotic systems have been widely used in different applications, and this has motivated researchers to develop different control methods. A model-free, intelligent, robust control method for a nonlinear robotic manipulator system is proposed in this work. This paper presents a novel solution for the major drawbacks of the sliding mode control scheme, which are chattering. Prior knowledge is needed about the dynamic model of the controlled system and the upper bound of uncertainty. In this paper, a fuzzy-like PD controller with SMC (FLPDSM) is proposed. The fuzzy-like PD controller was designed according to fuzzy rules and membership functions based on the nominal model of the robot manipulator. A robust control term was added to the control signal to compensate for the system uncertainty, and external disturbances are compensated by adding an auxiliary robust term to the SMC control law. Two methods for designing robust control terms are proposed. The first proposed method assumes that the upper bound of system uncertainty is known although it cannot be exactly determined due to external disturbances and uncertainty. Hence, a second method was proposed that assumes this bound to be unknown, and an adaptive gain based on Lyapunov theory was used to derive the adaptation law. The Lyapunov second method was used to ensure the stability of the closed loop system. Performance tests on the proposed methods were implemented through simulation studies for the two-link robotic manipulator, and the test results were compared with the standard SMC to verify the effectiveness of the proposed method. A good trajectory tracking with a high robustness against parameter variations and external disturbances was observed under the presented control scheme.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 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".