Real-Time Traffic State Estimation and Prediction for Active Traffic and Demand Management: The Application of DynaTAM
Bibliographic record
Abstract
Over the last decade, increased interests have been found in the field of Active Traffic and Demand Management (ATDM), and subsequently numerous simulation studies were devoted to see its effectiveness. Unfortunately, the real life benefits of ATDM application are not still apparent. This may be attributable to the following factors: (1) accuracy of traffic data obtained from the available field traffic sensors and failure to transmit the real-time and on-line data to the Traffic Management Centre (TMC); (2) absence of accurate traffic dynamics for the traffic state prediction; and (3) reliable field application software in the field of ATDM. To promise the above functions, in this research, DynaTAM—a field application tool is being developed by the authors. It can be used to analyze, simulate, and optimize traffic network in off-line or on-line mode. This paper presents the framework of DyanTAM and its communication protocol with the outer system, i.e. traffic control devices and field sensors. In the data management module, it has realized a practical data conditioning method which makes it suitable for ATDM application. The current version of this tool provides Variable Speed Limit (VSL) and Ramp Metering (RM) control as the start-up ATDM strategies with a hierarchical and coordinated control system. It evaluates the traffic states for roadway links by the well-known and parsimonious METANET and cell transmission model (CTM). Indeed, these macroscopic traffic models work as reference traffic simulators for traffic state prediction. As a preliminary evaluation, the VSL control module of DynaTAM will be tested this year on the Whitemud Drive (WMD), Edmonton. Therefore, the WMD project will be used in this paper as an exemplification, with some ideas and details given about the field test and application.
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.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".