Lane-Exchanging Driving Strategy for Autonomous Vehicle via Trajectory Prediction and Model Predictive Control
Bibliographic record
Abstract
Abstract The cooperation between an autonomous vehicle and a nearby vehicle is critical to ensure driving safety in the lane-exchanging scenario. The nearby vehicle trajectory needs to be predicted, from which the autonomous vehicle is controlled to prevent possible collisions. This paper proposes a lane-exchanging driving strategy for the autonomous vehicle to cooperate with the nearby vehicle by integrating vehicle trajectory prediction and motion control. A trajectory prediction method is developed to anticipate the nearby vehicle trajectory. The Gaussian mixture model (GMM), together with the vehicle kinematic model, are synthesized to predict the nearby vehicle trajectory. A potential-field-based model predictive control (MPC) approach is utilized by the autonomous vehicle to conduct the lane-exchanging maneuver. The potential field of the nearby vehicle is considered in the controller design for collision avoidance. On-road driving data verification shows that the nearby vehicle trajectory can be predicted by the proposed method. CarSim ® simulations validate that the autonomous vehicle can perform the lane-exchanging maneuver and avoid the nearby vehicle using the proposed driving strategy. The autonomous vehicle can thus safely perform the lane-exchanging maneuver and avoid the nearby vehicle.
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.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".