MétaCan
Menu
Retour à la cohorte
Enregistrement W6889081520 · doi:10.25394/pgs.26339413

Physics-Informed Graph Learning In Urban Traffic Networks

2024· dissertation· en· W6889081520 sur OpenAlexaboutno aff

Notice bibliographique

RevuePurdue · 2024
Typedissertation
Langueen
DomaineEngineering
ThématiqueTraffic Prediction and Management Techniques
Établissements canadiensnon disponible
Organismes subventionnairesDirectorate for Engineering
Mots-clésExploitGraphUrban planningMetric (unit)Network scienceUrban computingUrban networkTraffic generation modelFunction (biology)

Résumé

récupéré en direct d'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.

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Comment cette classification a été obtenuedéplier

Prédiction distillée sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.

score de la tête « metaresearch » (Codex)0,000
score de la tête « metaresearch » (Gemma)0,000
Version: codex-gemma-dda1882f352aStatut de validation: machine_predicted_unvalidated
Catégories candidatesMéta-épidémiologie (sens strict)
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Simulation ou modélisation · Signal consensuel: Simulation ou modélisation
GenreSignal candidat: Empirique · Signal consensuel: aucune
Score de désaccord entre enseignants0,827
Score d'incertitude au seuil1,000

Scores Codex et Gemma par catégorie

CatégorieCodexGemma
Métarecherche0,0000,000
Méta-épidémiologie (sens strict)0,0000,000
Méta-épidémiologie (sens large)0,0000,000
Bibliométrie0,0000,000
Études des sciences et des technologies0,0000,000
Communication savante0,0000,000
Science ouverte0,0000,000
Intégrité de la recherche0,0000,001
Charge utile insuffisante (le modèle a refusé de juger)0,0000,000

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,005
Tête enseignante GPT0,217
Écart entre enseignants0,212 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle

Classification

machine, non validée

Prédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.

Devis d'étudeSimulation ou modélisation
Domainenon disponible
GenreEmpirique

Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».

En bref

Citations0
Publié2024
Routes d'admission1
Résumé présentoui

Explorer davantage

Même revuePurdueMême sujetTraffic Prediction and Management TechniquesTravaux en français237 207