A Safe and Computationally Efficient Tracking Control Algorithm for Autonomous Vehicles
Bibliographic record
Abstract
This paper investigates the use of control barrier functions in conjunction with a recently developed output-tracking technique, with the aim of guaranteeing safe and smooth driving conditions for autonomous vehicles. The tracking technique in question has been developed by the authors of this paper for effectiveness as well as efficiency of computation, but its implementation may be fraught with large early input transients and state oscillations. The main objective of this paper is to investigate the use of control barrier functions for the dual purpose of safety guarantees and drastic reductions in the input oscillations and state overshoots. Furthermore, if the plant subsystem is differentially flat then we exploit this fact to further reduce the complexity of the control algorithm. As this is an initial study we focus the discussion on the particular example of a kinematic bicycle model, but argue for its potential generality to more complicated models of self-driving cars such as the dynamic bicycle. We test the aforementioned ideas by simulation and on a hardware platform, and the results suggest that the developed controller may have merits in autonomous vehicle applications.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".