MétaCan
Menu
Back to cohort
Record W6889081520 · doi:10.25394/pgs.26339413

Physics-Informed Graph Learning In Urban Traffic Networks

2024· dissertation· en· W6889081520 on OpenAlexaboutno aff

Bibliographic record

VenuePurdue · 2024
Typedissertation
Languageen
FieldEngineering
TopicTraffic Prediction and Management Techniques
Canadian institutionsnot available
FundersDirectorate for Engineering
KeywordsExploitGraphUrban planningMetric (unit)Network scienceUrban computingUrban networkTraffic generation modelFunction (biology)

Abstract

fetched live from OpenAlex

Urban traffic networks encompass the collection and interlinking of urban entities, including but not limited to road networks, congested segments, mobile populations, and emergency occurrences. These entities facilitate daily human activities, support economic endeavors, and influence the trajectory of societal advancement. Comprehending the characteristics and anticipating the evolution of dynamic urban traffic networks have been fundamental building blocks in urban science. Typical examples include the primal and dual representations of road networks, the macroscopic fundamental diagram applied to congested roads, and models on the spread of diseases. Current seminal studies either devise physics metrics and models to elucidate universal traits of urban traffic networks, or exploit data-driven approaches to depict the urban landscape using vast amounts of urban data. However, these physics and data-driven methods primarily function separately, resulting in a lack of a comprehensive framework to accurately and interpretably (1) characterize the topology and dynamics of urban traffic networks; and (2) forecast the evolution of dynamics within urban traffic networks.In this dissertation, we develop physics-informed graph learning methods to learn and forecast urban traffic networks in manners that are accurate, interpretable, adaptable, and applicable, aiming to advance urban science theories and support urban decision-making processes.In Chapters 3 and 4, we explore novel physics knowledge of urban traffic networks in terms of new metrics and equations. In Chapter 3, we define new morphological metrics for urban road networks. Specifically, we present a network metric called spatial homogeneity (SH), which gauges the topological similarities among urban road networks using graph neural networks. Employing this metric, we analyze 11,790 urban road networks across 30 cities worldwide. Our findings reveal the inherent correlations between innercity SH, gross domestic product, and population growth. Furthermore, we quantify learning trajectories between cities from intercity SH and connect them with existing qualitative urban studies. In Chapter 4, we establish new differential equations governing dynamic urban traffic. Through a symbolic regression-based learning approach, we come up with network-level dynamic traffic equations (NDTEs), which capture time-of-day traffic flow and traffic occupancy dynamics. The advantages of NDTEs are twofold: (1) all input variables are easily obtainable; (2) they incorporate vehicle count-related variables. Our experiments on road networks in Zurich and Toronto demonstrate that the generated NDTEs offer enhanced fitting accuracy compared to the baseline model while maintaining a moderate level of equation complexity.In Chapters 5, 6, and 7, we harness physics knowledge to devise graph learning approaches for urban prediction and imputation. In Chapter 5, we present NMFD-GNN, a physics-informed machine learning method that integrates the network macroscopic fundamental diagram and the graph neural network for traffic state imputation. Our approach is the first physics-informed machine learning model specifically designed for real-world traffic networks with multiple roads, while existing studies have primarily focused on individual road corridors. In Chapter 6, we develop the spatio-temporal physics ordinary differential equation (ST-PODE), which connects PODEs with spatio-temporal neural networks. ST-PODE is composed of the spatio-temporal neural network module, the PODE module, and the state transition module. We downscale our focus to the prediction of morning traffic patterns and evaluate our models using datasets from the Bay Area and Los Angeles. In Chapter 7, we address the multiwave COVID-19 prediction challenge on urban mobility networks. The proposed social awareness-based graph neural network (SAB-GNN) models the evolution of public awareness across multiple pandemic waves as an exponential function with learnable parameters. We employ the mobility, web search, and infection data in Tokyo from April 2020 to May 2021 to validate its performance. The intended audiences of this dissertation comprise colleagues in the fields of artificial intelligence, urban science, transportation engineering, and network science. Our goal is to offer instructive insights to the community to (1) explore universal properties, (2) foresee future evolution, and (3) interpret models and results using massive graph-structured data in urban traffic networks.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.827
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.005
GPT teacher head0.217
Teacher spread0.212 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venuePurdueSame topicTraffic Prediction and Management TechniquesFrench-language works237,207