Quantum Long Short-Term Memory-Assisted Optimization for Efficient Vehicle Platooning in Connected and Autonomous Systems
Bibliographic record
Abstract
Vehicle platooning, especially when dedicated to carrying goods, represents a forward-looking approach to optimizing logistics and freight transportation using autonomous vehicles. In this study, we propose to employ Quantum Long Short Term Memory (QLSTM) models to predict the vehicle dynamics of a leading vehicle of the platoon. This predictive capability allows the following vehicles to adjust their behaviours dynamically. By doing so, we aim to optimize control strategies and maintain string stability within vehicle platoons. This approach leverages the unique computational advantages of quantum computing, particularly in processing complex temporal data, potentially leading to more accurate and efficient dynamic systems in vehicular platoon infrastructure. The simulation results indicate that the QLSTM model is highly efficient by learning more information in fewer epochs compared to traditional Long Short Term Memory (LSTM) models. This efficiency contributes to minimizing control errors, enhancing the precision and reliability of vehicle dynamics in the context of autonomous vehicle platooning. This research not only enhances the predictability of autonomous vehicle platoons but also opens pathways for research into how quantum computing can be integrated into real-time dynamic systems analysis and 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.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".