Robust Car-Following Control of Connected and Autonomous Vehicles: A Stochastic Model Predictive Control Approach
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Vehicle platooning has attracted growing attention for its potential to enhance traffic capacity and road safety. This paper proposes an innovative distributed Stochastic Model Predictive Control (SMPC) for a vehicle platoon system to enhance the robustness and safety of the vehicles in uncertain traffic environments. In particular, considering the similarity between the acceleration or deceleration behaviour of neighbouring vehicles and the spring-scale properties, we use a two-mass spring system for the first time to construct an uncertain dynamic model of a formation system. In the presence of uncertain perturbations with known distributional attributes (expectation, variance), we propose an objective function in the form of expectation along with probabilistic chance constraints. Subsequently, a state feedback control mechanism is devised accordingly. Under the cumulative probability distribution function of stochastic perturbations, we theoretically derive a computationally tractable equivalent of the SMPC model. Finally, simulation experiments are designed to validate the control performance of the SMPC platoon controllers, along with an analysis of the stability performance under varying probabilities. The experimental findings demonstrate that the model can be efficiently solved in real-time with appropriately chosen prediction horizon lengths, ensuring robust and safe longitudinal vehicle formation control.
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.
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.001 | 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 it