Identifying dynamic interaction patterns in mandatory and discretionary lane changes using graph structure
Bibliographic record
Abstract
A quantitative understanding of dynamic lane-changing interaction patterns is indispensable for improving the decision-making of autonomous vehicles (AVs), especially in mixed traffic with human-driven vehicles. This paper develops a novel framework combining the hidden Markov model (HMM) and graph structure to identify the difference in dynamic interaction patterns between mandatory lane changes (MLC) and discretionary lane changes (DLC). An HMM is developed to separate the interaction patterns considering heterogeneity in lane-changing processes and reveal the temporal properties of these patterns. Conditional mutual information is used to quantify the interaction intensity, and the graph structure is used to characterize the relationship between vehicles. Finally, a case study is conducted to demonstrate the practical value of the proposed framework and validate its effectiveness in predicting lane-changing trajectories. Based on the lane-changing events extracted from a real-world trajectory dataset, the proposed analytical framework is applied to model MLC and DLC under congested traffic with levels of service E and F. The results show that there could be multiple heterogeneous dynamic interaction patterns in a lane-changing process. A comparison of MLC and DLC demonstrates that MLC involves more intense interactions and more frequent transitions of the interaction network structure, while the evolution rules of interaction patterns in DLC do not exhibit a clear trend. The findings in this study are useful for understanding the connectivity structure between vehicles in lane-changing interactions and for designing safe and smooth driving decision-making models for AVs and advanced driver-assistance systems.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| 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".