Lateral control of an autonomous vehicle using integrated backstepping and sliding mode controller
Bibliographic record
Abstract
In this paper, a novel Lyapunov-based robust controller by using meta-heuristic optimization algorithm has been proposed for lateral control of an autonomous vehicle. In the first step, double lane change path has been designed using a fifth-degree polynomial (quantic) function and dynamic constraints. A lane changing path planning method has been used to design the double lane change manoeuvre. In the next step, position and orientation errors have been extracted based on the two-degree-of-freedom vehicle bicycle model. A combination of sliding mode and backstepping controllers has been used to control the steering in this paper. Overall stability of the combined controller has been analytically proved by defining a Lyapunov function and based on Lyapunov stability theorem. The proposed controller includes some constant parameters which have effects on controller performance; therefore, particle swarm optimization algorithm has been used for finding optimum values of these parameters. The comparing result of the proposed controller with backstepping controller illustrated the better performance of the proposed controller, especially in the low road frictions. Simulation of designed controllers has been conducted by linking CarSim software with Matlab/Simulink which provides a nonlinear full vehicle model. The simulation was performed for manoeuvres with different durations and road frictions. The proposed controller has outperformed the backstepping controller, especially in low frictions.
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.000 |
| 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.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".