An Extended Car-Following Model in Connected and Autonomous Vehicle Environment: Perspective from the Cooperation between Drivers
Bibliographic record
Abstract
The development of connected and autonomous vehicle (CAV) technology has received increasing attention in recent years. Although car-following behavior in mixed traffic with CAVs and human-driven vehicles (HDVs) is a core component of microscopic traffic simulation, intelligent traffic systems, etc., the current study of car-following behavior in mixed traffic has some limitations. Furthermore, actual data do not support its applicability to the Chinese traffic environment. To address this gap, this paper designs and organizes a car-following experiment in mixed traffic in Beijing, extracts the trajectory data of CAVs and HDVs based on video recognition, and reconstructs the extracted trajectory data using the Lagrangian theory and Kalman filter theory to ensure the accuracy of the data. Based on this data set, this paper develops an extended car-following model. The model considers the cooperation between drivers by reformulating the prospect theory (PT). The root mean square percentage error (RMSPE) is selected to calibrate and validate the parameters of the proposed model, and the results show that there is significant heterogeneity between CAVs and HDVs in mixed traffic, and the proposed model captures this heterogeneity well. The model presented in this paper provides theoretical support for microscopic traffic simulation in mixed traffic.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".