Manoeuvre prediction and planning for automated and connected vehicles based on interaction and gaming awareness under uncertainty
Bibliographic record
Abstract
The complex and mixed traffic environment makes it a challenge for the widespread use of automated and connected vehicles (ACVs). It is necessary for these systems to have a better understanding of the traffic environment including interaction and gaming between multiple vehicles. In this study, a manoeuvre prediction and planning framework is proposed on the basis of game theories for complex and mixed traffic scenarios via vehicle‐to‐everything communication. In this framework, the interaction and gaming between multiple vehicles are considered by employing the extensive form game theories. In the payoff function, the risk assessment model based on trajectory prediction under uncertainty is employed to assess collision risks. Driving efficiency and preference are also combined in the payoff function. Uncertainty elements, including estimation and prediction, are considered to predict and plan by using Nash equilibrium of the extensive form game theory in mixed and behavioural strategies. Finally, this framework is applied and proved in different lane‐change scenarios. The results show that this framework could predict other vehicles’ driving manoeuvres and plan manoeuvres for ego vehicles by considering interaction and gaming between multiple vehicles, which helps ACVs understand the environment better and make the cooperative manoeuvre planning in complex traffic scenarios.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 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.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".