An Unscented Kalman Filter-Based Method for Reconstructing Vehicle Trajectories at Signalized Intersections
Bibliographic record
Abstract
On-board data of detected vehicles play a critical role in the management of urban road traffic operation and the estimation of traffic status. Unfortunately, due to limitations of technology and privacy issues, the sampling frequency of the detected vehicle data is low and the coverage is also limited. Continuous vehicle trajectories cannot be obtained. To overcome the above problems, this paper proposes an unscented Kalman filter (UKF)-based method to reconstruct the trajectories at signalized intersections using sparse probe data of vehicles. We first divide the intersection into multiple road sections and use a quadratic programming problem to estimate the travel time of each section. The weight of each initial possible trajectory is calculated separately, and the trajectory is updated using the unscented Kalman filter (UKF); then, the trajectory between two updates is also obtained accordingly. Finally, the method is applied to the actual scenario provided by the NGSIM data and compared with the real trajectory. The mean absolute error (MAE) is adopted to evaluate the accuracy of the proposed trajectory reconstruction. Sensitivity analysis is provided in order to provide the requirement of sampling frequency to obtain highly accurate reconstructed vehicle trajectories under this method. The results demonstrate the applicability of the technique to the signalized intersection. Therefore, the method enables us to obtain richer and more accurate trajectory data information, providing a strong prior basis for future urban road traffic management and scholars using trajectory data for various studies.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 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 teacher head, 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".