Adaptive Robust Terminal Sliding Mode Control with Integral Backstepping Synthesized Method for Autonomous Ground Vehicle Control
Bibliographic record
Abstract
Autonomous ground vehicles (AGVs) operating in complex environments face the challenge of accurately following desired paths while accounting for uncertainties, external disturbances, and initial conditions, necessitating robust and adaptive control strategies. This paper addresses the critical path-tracking task in AGVs through a novel control framework for multilevel speed AGVs, considering both structured and unstructured uncertainties. The control system introduced in this study utilizes a nonlinear adaptive approach by integrating integral backstepping with terminal sliding mode control (IBTSMC). By incorporating integral action, IBTSMC continuously adjusts the control input to minimize tracking errors, improving tracking performance. The hybridization of the terminal sliding mode method enables finite time convergence, robustness, and a chatter-free response with reduced sensitivity to initial conditions. Furthermore, adaptive control compensators are developed to ensure robustness against unknown but bounded external disturbances. The Lyapunov stability theorem is employed to guarantee the global asymptotic stability of the closed-loop system and the convergence of tracking errors to the origin within finite time. To validate the effectiveness of the proposed control scheme, high-fidelity cosimulations are conducted using CarSim and MATLAB. Comparative analysis is performed with other methods reported in the literature. The results confirm that the proposed controller demonstrates competitive effectiveness in path-tracking tasks and exhibits strong efficiency under various road conditions, parametric uncertainties, and unknown disturbances.
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.000 |
| Research integrity | 0.000 | 0.001 |
| 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".