Vehicle Speed and Position Estimation considering Microscopic Heterogeneous Car-Following Characteristics in Connected Vehicle Environments
Bibliographic record
Abstract
This paper proposes a method for estimating the speed and position of unsampled vehicles using sampled data from connected automated vehicles (CAVs). The determination of vehicle speed and position on the road is a challenging and crucial task, as they can effectively reflect traffic flow characteristics and contribute to traffic state estimation and intersection signal timing optimization. Connected automated vehicles have the capability to upload their own trajectory data while also capturing trajectory data of surrounding vehicles through onboard sensors. Therefore, this paper proposes a novel approach to estimate the speed and position of unsampled vehicles. Firstly, using real vehicle trajectory data, the correlation between the velocity of following vehicles and the velocity of leading vehicles under different densities is analyzed, leading to the development of a velocity estimation model incorporating a speed correction factor. Secondly, the correlation between time headway, the rate of change of following vehicle acceleration, and traffic density is examined. To address the issue of heterogeneous behavior in vehicle following described by the Intelligent Driver Model (IDM), a real-time optimization model for estimating vehicle position by optimizing IDM parameters is proposed. The velocity estimation model and the position estimation model are summarized as two nonlinear optimization problems. Finally, the proposed method is validated using actual vehicle trajectory data. Experimental results demonstrate that when the number of connected automated vehicles (CAVs) is 2, the proposed method reduces the average absolute error by 30.73% and the standard deviation of the average absolute error by 42.8% compared to a linear model-based speed estimation method under different density conditions. Compared to a method that estimates vehicle position by calibrating desired gaps, the proposed method reduces the average absolute error by 38.2% and the standard deviation of the average absolute error by 41.7% under different density conditions. Furthermore, the proposed method exhibits good practicality under different CAV penetration rates.
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.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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".