Vehicle Lane Change Multistep Trajectory Prediction Based on Data and CNN_BiLSTM Model
Bibliographic record
Abstract
In order to accurately predict the lane‐changing trajectory of the vehicle and improve the driving safety of the vehicle, a lane‐changing trajectory prediction model based on the combination of convolutional neural network (CNN) and bidirectional long short‐term memory (BiLSTM) neural network is proposed by comprehensively considering the historical driving behavior, the spatial characteristics of surrounding vehicles and the bidirectional time sequence information of the vehicle trajectory. Firstly, the vehicle trajectory data are filtered and smoothed, and it is divided into three categories: left lane change, right lane change, and straight driving, and a lane change trajectory sample set is constructed. Secondly, CNN‐BiLSTM model is constructed to identify the sample set of lane‐changing trajectory. Considering the interaction between vehicles in the driving process, the information of predicted vehicle, and surrounding vehicles is taken as the input of the model. The extracted feature vector is input to the BiLSTM layer for prediction after the CNN layer feature extraction, and the horizontal and vertical coordinates of the target vehicle at the next time are output. Thirdly, the trajectory data of the US‐101 dataset in NGSIM is selected to verify the performance of the CNN‐BiLSTM model, and at the same time, it is compared with models such as CNN‐LSTM, long short‐term memory (LSTM), BiLSTM, and CNN‐GRU‐Att. Finally, the verification result shows that the overall fitting degree of the vehicle lane change trajectory prediction of the proposed model reaches 99.50%, and the mean square error and mean absolute error are 0.0003076 and 0.01417, which are improved compared with other models. In the meanwhile, the research on multistep trajectory prediction in different prediction time domains is carried out. It was found that the longer the prediction time domain is, the lower the prediction performance of the model decreases, but the prediction accuracy still reached more than 96%, and it was able to accurately predict the lane change trajectory.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".