A Kalman filter approach to dynamic OD flow estimation for urban road networks using multi‐sensor data
Bibliographic record
Abstract
Summary Considerable efforts have been devoted to the development of dynamic origin‐destination (OD) estimation models, which are a key step to realizing self‐adaptive traffic control systems for urban traffic management. However, most of the models proposed to date estimate OD flows based on a single traffic data source, and their performance is limited by the coverage and accuracy of traffic sensors. The inherent difficulty in estimating the dynamic traffic assignment matrix means that dynamic OD estimation remains a challenge for real‐life applications. This paper proposes the use of a Kalman filter for dynamic OD estimation using multi‐source sensor data. The dynamic characteristic of changing OD flow over time is analyzed, and the problem of dynamic OD estimation is converted to a problem of estimating OD structural deviation. The resulting dynamic relationship between traffic volume and OD structural deviation is then used to establish the Kalman filter model. An improved traffic assignment approach is developed and embedded into the measurement equation of the Kalman filter model to enable dynamic updating of the traffic assignment matrix. A dual self‐adaptive mechanism based on the Kalman filter is used to calibrate the model. The proposed method was implemented on a real‐life traffic network in the downtown area of Kunshan City, China. The results show that the proposed method is more accurate than, and outperforms, the traditional link‐volume‐based and turning‐movement‐based methods. Copyright © 2014 John Wiley & Sons, Ltd.
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.000 | 0.000 |
| 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".