Pub Date : 2025-12-01DOI: 10.1016/j.commtr.2025.100224
Fizza Hussain , Yuefeng Li , Shimul Md Mazharul Haque
Recent developments in artificial intelligence (AI) have made significant improvements in understanding and enhancing pedestrian safety—a vulnerable road user group that receives less attention than motorized road users do. Specifically, AI-based video analytics have provided insight into facilitating real-time safety at signalized intersections. However, past studies have not fully realized the essence of real-time analysis, which underpins forecasting pedestrian collision likelihood by analyzing how past extreme events influence future risk over sequential intervals. To this end, we combine extreme value theory and machine learning models for real-time pedestrian collision risk forecasting. Traffic conflicts and their associated variables were identified from 288 h of video footage obtained from three signalized intersections in Queensland, Australia, via computer vision techniques, including YOLO and DeepSORT, to obtain the post encroachment time for vehicle‒pedestrian interactions. A Bayesian non-stationary peak over threshold (POT) is developed to obtain real-time pedestrian crash risk at the signal cycle level. The performance of the POT model is compared with observed crashes, and the results demonstrate the reasonable accuracy of the model. The estimated pedestrian crash risk at each signal cycle forms contiguous univariate time series data (which serve as ground truth), which are used as input to develop time series machine learning models (recurrent neural networks (RNNs) and long short-term memory (LSTM)). Both of these models forecast pedestrian crash risk, with the RNN model outperforming the competing model and demonstrating that pedestrian crash risk can be reliably estimated 30−33 min in advance.
{"title":"Machine learning-based real-time crash risk forecasting for pedestrians","authors":"Fizza Hussain , Yuefeng Li , Shimul Md Mazharul Haque","doi":"10.1016/j.commtr.2025.100224","DOIUrl":"10.1016/j.commtr.2025.100224","url":null,"abstract":"<div><div>Recent developments in artificial intelligence (AI) have made significant improvements in understanding and enhancing pedestrian safety—a vulnerable road user group that receives less attention than motorized road users do. Specifically, AI-based video analytics have provided insight into facilitating real-time safety at signalized intersections. However, past studies have not fully realized the essence of real-time analysis, which underpins forecasting pedestrian collision likelihood by analyzing how past extreme events influence future risk over sequential intervals. To this end, we combine extreme value theory and machine learning models for real-time pedestrian collision risk forecasting. Traffic conflicts and their associated variables were identified from 288 h of video footage obtained from three signalized intersections in Queensland, Australia, via computer vision techniques, including YOLO and DeepSORT, to obtain the post encroachment time for vehicle‒pedestrian interactions. A Bayesian non-stationary peak over threshold (POT) is developed to obtain real-time pedestrian crash risk at the signal cycle level. The performance of the POT model is compared with observed crashes, and the results demonstrate the reasonable accuracy of the model. The estimated pedestrian crash risk at each signal cycle forms contiguous univariate time series data (which serve as ground truth), which are used as input to develop time series machine learning models (recurrent neural networks (RNNs) and long short-term memory (LSTM)). Both of these models forecast pedestrian crash risk, with the RNN model outperforming the competing model and demonstrating that pedestrian crash risk can be reliably estimated 30−33 min in advance.</div></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":"5 ","pages":"Article 100224"},"PeriodicalIF":14.5,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145617648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01DOI: 10.1016/j.commtr.2025.100227
Zihe Wang , Haiyang Yu , Changxin Chen , Zhiyong Cui , Yufeng Bi , Yilong Ren , Zijian Wang , Delan Kong , Jing Tian , Shoutong Yuan , Zhiqiang Li
Video-based road intelligent detection constitutes a critical component in modern intelligent transportation systems, serving as a crucial role for comprehensive transportation planning and emergency traffic management. Current traffic scene perception methodologies relying on conventional deep learning architectures present inherent limitations, including heavy dependence on extensive manual annotations of specific traffic scenarios and predefined rule configurations. These approaches demonstrate constrained semantic representation capacity and limited generalizability across heterogeneous traffic scenarios. To address these challenges, this study proposes a novel end-to-end multimodal foundation model architecture that jointly generates dynamic traffic event detection outcomes and semantic-rich contextual descriptions. Through integration of low-rank adaptation (LoRA) and prompt fine-tuning as parameter-efficient fine-tuning strategies, we develop the multimodal road traffic scene understanding foundation model (MoTIF), which establishes cross-modal alignment between visual patterns and textual semantics. This framework demonstrates enhanced capability in extracting salient traffic targets and generating hierarchical scene representations, significantly improving automated detection efficiency in road video analytics. Notably, MoTIF exhibits contextual reasoning capabilities for implicit traffic event interpretation. Extensive evaluations on two real-world datasets encompassing urban road intersection scenarios in Tianjin and highway monitoring systems in Shandong Province reveal that MoTIF achieves superior performance metrics: 65.81 average score on multimodal scene understanding assessment and 83.33% event detection accuracy, outperforming mainstream benchmarks in both precision and computational efficiency. This research advances multimodal learning paradigms for intelligent transportation systems while providing practical insights for adaptive traffic management applications.
{"title":"MoTIF: An end-to-end multimodal road traffic scene understanding foundation model","authors":"Zihe Wang , Haiyang Yu , Changxin Chen , Zhiyong Cui , Yufeng Bi , Yilong Ren , Zijian Wang , Delan Kong , Jing Tian , Shoutong Yuan , Zhiqiang Li","doi":"10.1016/j.commtr.2025.100227","DOIUrl":"10.1016/j.commtr.2025.100227","url":null,"abstract":"<div><div>Video-based road intelligent detection constitutes a critical component in modern intelligent transportation systems, serving as a crucial role for comprehensive transportation planning and emergency traffic management. Current traffic scene perception methodologies relying on conventional deep learning architectures present inherent limitations, including heavy dependence on extensive manual annotations of specific traffic scenarios and predefined rule configurations. These approaches demonstrate constrained semantic representation capacity and limited generalizability across heterogeneous traffic scenarios. To address these challenges, this study proposes a novel end-to-end multimodal foundation model architecture that jointly generates dynamic traffic event detection outcomes and semantic-rich contextual descriptions. Through integration of low-rank adaptation (LoRA) and prompt fine-tuning as parameter-efficient fine-tuning strategies, we develop the multimodal road traffic scene understanding foundation model (MoTIF), which establishes cross-modal alignment between visual patterns and textual semantics. This framework demonstrates enhanced capability in extracting salient traffic targets and generating hierarchical scene representations, significantly improving automated detection efficiency in road video analytics. Notably, MoTIF exhibits contextual reasoning capabilities for implicit traffic event interpretation. Extensive evaluations on two real-world datasets encompassing urban road intersection scenarios in Tianjin and highway monitoring systems in Shandong Province reveal that MoTIF achieves superior performance metrics: 65.81 average score on multimodal scene understanding assessment and 83.33% event detection accuracy, outperforming mainstream benchmarks in both precision and computational efficiency. This research advances multimodal learning paradigms for intelligent transportation systems while providing practical insights for adaptive traffic management applications.</div></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":"5 ","pages":"Article 100227"},"PeriodicalIF":14.5,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145736818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01DOI: 10.1016/j.commtr.2025.100230
Jinpeng Zhang , Yan Xu , Kaiquan Cai , Victor Gordo , Gokhan Inalhan
Risk assessment is a key issue when handling the increasing use of unmanned aircraft systems (UASs), especially in integrated operational urban airspace. This study proposes a method to systematically quantify the mid-air collision (MAC) risk for different operation types in urban air mobility (UAM). Specifically, a novel assessment framework is formulated that includes three timelines to track risk evolution for integrated operations (i.e., cooperative, non-cooperative, and manned aircraft) and four safety barriers (i.e., procedural, strategic, tactical, and collision avoidance mitigation) to prevent a conflict ending in MAC. Under the framework, analytical models are established considering trajectory uncertainty, latency time, and detection and avoidance (DAA) system risk ratio to calculate the failure probability of each barrier, and thus an overall MAC probability. Result-oriented, process-oriented and comprehensive Monte Carlo simulations are constructed to validate the proposed models and the MAC assessment timeline, followed by demonstrating four operational scenarios in real-world environment to illustrate the assessment process of the method. Results show that the simulation probability curves closely match the theoretical predictions. The cooperative UAS contributes the highest MAC risk in our designed integrated environment, with strategic mitigation failures accounting for the largest proportion, and thus effective strategic trajectory planning is crucial for maintaining the safety of integrated operations.
{"title":"Quantitative assessment of mid-air collision probability in urban air mobility: A safety barrier-based framework for integrated operations","authors":"Jinpeng Zhang , Yan Xu , Kaiquan Cai , Victor Gordo , Gokhan Inalhan","doi":"10.1016/j.commtr.2025.100230","DOIUrl":"10.1016/j.commtr.2025.100230","url":null,"abstract":"<div><div>Risk assessment is a key issue when handling the increasing use of unmanned aircraft systems (UASs), especially in integrated operational urban airspace. This study proposes a method to systematically quantify the mid-air collision (MAC) risk for different operation types in urban air mobility (UAM). Specifically, a novel assessment framework is formulated that includes three timelines to track risk evolution for integrated operations (i.e., cooperative, non-cooperative, and manned aircraft) and four safety barriers (i.e., procedural, strategic, tactical, and collision avoidance mitigation) to prevent a conflict ending in MAC. Under the framework, analytical models are established considering trajectory uncertainty, latency time, and detection and avoidance (DAA) system risk ratio to calculate the failure probability of each barrier, and thus an overall MAC probability. Result-oriented, process-oriented and comprehensive Monte Carlo simulations are constructed to validate the proposed models and the MAC assessment timeline, followed by demonstrating four operational scenarios in real-world environment to illustrate the assessment process of the method. Results show that the simulation probability curves closely match the theoretical predictions. The cooperative UAS contributes the highest MAC risk in our designed integrated environment, with strategic mitigation failures accounting for the largest proportion, and thus effective strategic trajectory planning is crucial for maintaining the safety of integrated operations.</div></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":"5 ","pages":"Article 100230"},"PeriodicalIF":14.5,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145683860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01DOI: 10.1016/j.commtr.2025.100226
Dan Zhu , ChiSin Ng , Litian Xie , Yang Liu
Traffic congestion prediction plays a crucial role in mitigating congestion. However, the COVID-19 pandemic and associated government control measures have significantly altered urban travel behavior, increasing the complexity of traffic congestion prediction. This study aims to predict traffic congestion in Alameda County in the San Francisco Bay Area, USA, during the prelockdown, lockdown, and postlockdown periods. We incorporate three external categories of data, i.e., weather conditions, seasonality factors, and COVID-19-related variables, and use recursive feature elimination with cross-validation to identify important features across different periods and avoid potential overfitting. On this basis, multiple advanced machine learning (ML) models, including support vector regression (SVR), multiple linear regression (MLR), recurrent neural network (RNN), and long short-term memory (LSTM) networks, are trained and optimized through extensive experimentation and parameter tuning. Since LSTM has more hyperparameters and is more sensitive to tuning than the other ML methods used, we employ an adaptive parameter selection approach to optimize its hyperparameters, enhancing model accuracy and efficiency, rather than manually tuning parameters for SVR and RNN. These models are evaluated via the normalized root mean square error. The results indicate that the bidirectional LSTM (Bi-LSTM) consistently outperforms the other models across all COVID-19 periods. This superior performance can be attributed to the Bi-LSTM's bidirectional architecture, which effectively captures temporal dependencies by analyzing data both forward and backward in time. To address the limited interpretability of ML methods and provide valuable insights, we apply the integrated gradient (IG) technique to interpret the best-performing and differentiable Bi-LSTM predictions. Our analysis revealed that new COVID-19 cases had a negative influence on traffic congestion during the lockdown and postlockdown periods. The observed reduction in traffic can be explained by heightened public risk awareness, voluntary reductions in travel, and compliance with government-imposed mobility restrictions. We also apply SHapley Additive exPlanations to SVR, given that IG is not applicable to this model. The results indicate that in the postpandemic period, people have become more cautious—high new hospitalization discourages travel, reducing traffic congestion, whereas high fuel prices do not deter a shift toward private vehicle use, leading to increased congestion.
{"title":"Interpretable machine learning for traffic congestion prediction: Unveiling the impact of different COVID-19 periods","authors":"Dan Zhu , ChiSin Ng , Litian Xie , Yang Liu","doi":"10.1016/j.commtr.2025.100226","DOIUrl":"10.1016/j.commtr.2025.100226","url":null,"abstract":"<div><div>Traffic congestion prediction plays a crucial role in mitigating congestion. However, the COVID-19 pandemic and associated government control measures have significantly altered urban travel behavior, increasing the complexity of traffic congestion prediction. This study aims to predict traffic congestion in Alameda County in the San Francisco Bay Area, USA, during the prelockdown, lockdown, and postlockdown periods. We incorporate three external categories of data, i.e., weather conditions, seasonality factors, and COVID-19-related variables, and use recursive feature elimination with cross-validation to identify important features across different periods and avoid potential overfitting. On this basis, multiple advanced machine learning (ML) models, including support vector regression (SVR), multiple linear regression (MLR), recurrent neural network (RNN), and long short-term memory (LSTM) networks, are trained and optimized through extensive experimentation and parameter tuning. Since LSTM has more hyperparameters and is more sensitive to tuning than the other ML methods used, we employ an adaptive parameter selection approach to optimize its hyperparameters, enhancing model accuracy and efficiency, rather than manually tuning parameters for SVR and RNN. These models are evaluated via the normalized root mean square error. The results indicate that the bidirectional LSTM (Bi-LSTM) consistently outperforms the other models across all COVID-19 periods. This superior performance can be attributed to the Bi-LSTM's bidirectional architecture, which effectively captures temporal dependencies by analyzing data both forward and backward in time. To address the limited interpretability of ML methods and provide valuable insights, we apply the integrated gradient (IG) technique to interpret the best-performing and differentiable Bi-LSTM predictions. Our analysis revealed that new COVID-19 cases had a negative influence on traffic congestion during the lockdown and postlockdown periods. The observed reduction in traffic can be explained by heightened public risk awareness, voluntary reductions in travel, and compliance with government-imposed mobility restrictions. We also apply SHapley Additive exPlanations to SVR, given that IG is not applicable to this model. The results indicate that in the postpandemic period, people have become more cautious—high new hospitalization discourages travel, reducing traffic congestion, whereas high fuel prices do not deter a shift toward private vehicle use, leading to increased congestion.</div></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":"5 ","pages":"Article 100226"},"PeriodicalIF":14.5,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145617647","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01DOI: 10.1016/j.commtr.2025.100223
Guoyang Qin , Shidi Deng , Qi Luo , Jian Sun
The (static) traffic assignment (TA) problem, which computes network equilibrium flows from origin–destination (OD) demand under flow conservation, is central to transportation modeling. As multimodal transportation systems (MTSs) grow, sharing detailed OD data – such as trip counts, timestamps, and routes – raises serious privacy concerns. Differential privacy (DP) has emerged as the leading standard for releasing such data, offering adjustable protection beyond traditional anonymization. However, current methods mostly apply extrinsic DP by adding noise to aggregate OD matrices before release, without fully addressing its effects on traffic modeling. This reveals TA’s unpreparedness for privacy-protected data and calls for redesigned methods that operate reliably under such constraints. To fill this gap, we propose the privacy-preserving traffic assignment (PPTA) framework, which embeds DP intrinsically within the TA process. Instead of externally perturbing aggregate demand, PPTA injects structured noise at the individual trip level. This preserves privacy while ensuring equilibrium feasibility through chance-constrained optimization, unifying privacy protection and traffic assignment. The framework supports various discrete choice models and noise types, using a moment-based approximation to boost computational efficiency. Our results show PPTA attains a privacy-utility balance beyond extrinsic methods, enabling robust, privacy-aware multimodal routing, network design, and pricing.
{"title":"Multimodal traffic assignment from privacy-protected OD data","authors":"Guoyang Qin , Shidi Deng , Qi Luo , Jian Sun","doi":"10.1016/j.commtr.2025.100223","DOIUrl":"10.1016/j.commtr.2025.100223","url":null,"abstract":"<div><div>The (static) traffic assignment (TA) problem, which computes network equilibrium flows from origin–destination (OD) demand under flow conservation, is central to transportation modeling. As multimodal transportation systems (MTSs) grow, sharing detailed OD data – such as trip counts, timestamps, and routes – raises serious privacy concerns. Differential privacy (DP) has emerged as the leading standard for releasing such data, offering adjustable protection beyond traditional anonymization. However, current methods mostly apply extrinsic DP by adding noise to aggregate OD matrices before release, without fully addressing its effects on traffic modeling. This reveals TA’s unpreparedness for privacy-protected data and calls for redesigned methods that operate reliably under such constraints. To fill this gap, we propose the privacy-preserving traffic assignment (PPTA) framework, which embeds DP intrinsically within the TA process. Instead of externally perturbing aggregate demand, PPTA injects structured noise at the individual trip level. This preserves privacy while ensuring equilibrium feasibility through chance-constrained optimization, unifying privacy protection and traffic assignment. The framework supports various discrete choice models and noise types, using a moment-based approximation to boost computational efficiency. Our results show PPTA attains a privacy-utility balance beyond extrinsic methods, enabling robust, privacy-aware multimodal routing, network design, and pricing.</div></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":"5 ","pages":"Article 100223"},"PeriodicalIF":14.5,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145683864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-21DOI: 10.1016/j.commtr.2025.100225
Leizhen Wang , Peibo Duan , Cheng Lyu , Zewen Wang , Zhiqiang He , Nan Zheng , Zhenliang Ma
The evolution of metropolitan cities and increasing travel demand impose stringent requirements on traffic assignment methods. Multi-agent reinforcement learning (MARL) approaches outperform traditional methods in modeling adaptive routing behavior without requiring explicit system dynamics, making them attractive for real-world deployment. However, existing MARL frameworks face scalability and reliability challenges when managing large-scale networks with substantial and variable demand. This study proposes MARL-OD-DA, a novel framework that redefines agents as origin–destination (OD) pair routers and employs a continuous simplex-constrained action space. This reformulation reduces the agent population from O(N) (number of travelers) to O(|D|) (number of OD pairs), achieving at least two orders of magnitude fewer agents in practice while preserving convexity and enabling efficient adaptation to demand variation, thus significantly improving scalability. In contrast to prior MARL studies constrained to small-sized networks (up to 70 nodes, 2100 travelers) and fixed demand, MARL-OD-DA is validated on medium-sized networks (up to 416 nodes, 1406 OD pairs, and 360,600 travelers) under varying demand scenarios, demonstrating substantial improvements in scalability and applicability. To further enhance reliability, the framework integrates a Dirichlet-based policy, action pruning, and a relative gap-based reward. Theoretical analysis demonstrates that the Dirichlet-based policy reduces gradient bias, stabilizes variance, and enables sparse routing decisions, in contrast to the commonly used softmax-based policy. Experiments on three benchmark networks show that MARL-OD-DA significantly improves assignment quality and convergence speed. On the SiouxFalls network, the trained agents converge within 10 iterations during deployment, reducing the relative gap by 94.99% compared to conventional baselines.
{"title":"Scalable and reliable multi-agent reinforcement learning for traffic assignment","authors":"Leizhen Wang , Peibo Duan , Cheng Lyu , Zewen Wang , Zhiqiang He , Nan Zheng , Zhenliang Ma","doi":"10.1016/j.commtr.2025.100225","DOIUrl":"10.1016/j.commtr.2025.100225","url":null,"abstract":"<div><div>The evolution of metropolitan cities and increasing travel demand impose stringent requirements on traffic assignment methods. Multi-agent reinforcement learning (MARL) approaches outperform traditional methods in modeling adaptive routing behavior without requiring explicit system dynamics, making them attractive for real-world deployment. However, existing MARL frameworks face scalability and reliability challenges when managing large-scale networks with substantial and variable demand. This study proposes MARL-OD-DA, a novel framework that redefines agents as origin–destination (OD) pair routers and employs a continuous simplex-constrained action space. This reformulation reduces the agent population from <em>O</em>(<em>N</em>) (number of travelers) to <em>O</em>(|<em>D</em>|) (number of OD pairs), achieving at least two orders of magnitude fewer agents in practice while preserving convexity and enabling efficient adaptation to demand variation, thus significantly improving scalability. In contrast to prior MARL studies constrained to small-sized networks (up to 70 nodes, 2100 travelers) and fixed demand, MARL-OD-DA is validated on medium-sized networks (up to 416 nodes, 1406 OD pairs, and 360,600 travelers) under varying demand scenarios, demonstrating substantial improvements in scalability and applicability. To further enhance reliability, the framework integrates a Dirichlet-based policy, action pruning, and a relative gap-based reward. Theoretical analysis demonstrates that the Dirichlet-based policy reduces gradient bias, stabilizes variance, and enables sparse routing decisions, in contrast to the commonly used softmax-based policy. Experiments on three benchmark networks show that MARL-OD-DA significantly improves assignment quality and convergence speed. On the SiouxFalls network, the trained agents converge within 10 iterations during deployment, reducing the relative gap by 94.99% compared to conventional baselines.</div></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":"5 ","pages":"Article 100225"},"PeriodicalIF":14.5,"publicationDate":"2025-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145571109","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-18DOI: 10.1016/j.commtr.2025.100229
Xuewei Tang , Mengmeng Yang , Tuopu Wen , Peijin Jia , Le Cui , Mingshan Luo , Kehua Sheng , Bo Zhang , Kun Jiang , Diange Yang
With the growing interest in autonomous driving, there is an increasing demand for accurate and reliable road perception technologies. In complex environments without high-definition map support, autonomous vehicles must independently interpret their surroundings to ensure safe and robust decision-making. However, these scenarios pose significant challenges due to the large number, complex geometries, and frequent occlusions of road elements. A key limitation of existing approaches lies in their insufficient exploitation of the structured priors inherently present in road elements, resulting in irregular, inaccurate predictions. To address this, we propose PriorFusion, a unified framework that effectively integrates semantic, geometric, and generative priors to enhance road element perception. We introduce an instance-aware attention mechanism guided by shape-prior features, then construct a data-driven shape template space that encodes low-dimensional representations of road elements, enabling clustering to generate anchor points as reference priors. We design a diffusion-based framework that leverages these prior anchors to generate accurate and complete predictions. Experiments on large-scale autonomous driving datasets demonstrate that our method significantly improves perception accuracy, particularly under challenging conditions. Visualization results further confirm that our approach produces more accurate, regular, and coherent predictions of road elements.
{"title":"PriorFusion: Unified integration of priors for robust road perception in autonomous driving","authors":"Xuewei Tang , Mengmeng Yang , Tuopu Wen , Peijin Jia , Le Cui , Mingshan Luo , Kehua Sheng , Bo Zhang , Kun Jiang , Diange Yang","doi":"10.1016/j.commtr.2025.100229","DOIUrl":"10.1016/j.commtr.2025.100229","url":null,"abstract":"<div><div>With the growing interest in autonomous driving, there is an increasing demand for accurate and reliable road perception technologies. In complex environments without high-definition map support, autonomous vehicles must independently interpret their surroundings to ensure safe and robust decision-making. However, these scenarios pose significant challenges due to the large number, complex geometries, and frequent occlusions of road elements. A key limitation of existing approaches lies in their insufficient exploitation of the structured priors inherently present in road elements, resulting in irregular, inaccurate predictions. To address this, we propose PriorFusion, a unified framework that effectively integrates semantic, geometric, and generative priors to enhance road element perception. We introduce an instance-aware attention mechanism guided by shape-prior features, then construct a data-driven shape template space that encodes low-dimensional representations of road elements, enabling clustering to generate anchor points as reference priors. We design a diffusion-based framework that leverages these prior anchors to generate accurate and complete predictions. Experiments on large-scale autonomous driving datasets demonstrate that our method significantly improves perception accuracy, particularly under challenging conditions. Visualization results further confirm that our approach produces more accurate, regular, and coherent predictions of road elements.</div></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":"5 ","pages":"Article 100229"},"PeriodicalIF":14.5,"publicationDate":"2025-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145571166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-18DOI: 10.1016/j.commtr.2025.100222
Zijian Hu , Zhenjie Zheng , Monica Menendez , Wei Ma
Network-wide traffic flow, which captures dynamic traffic volume on each link of a general network, is fundamental to smart mobility applications. However, the observed traffic flow from sensors is usually limited across the entire network due to the associated high installation and maintenance costs. To address this issue, existing research uses various supplementary data sources to compensate for insufficient sensor coverage and estimate the unobserved traffic flow. Although these studies have shown promising results, the inconsistent availability and quality of supplementary data across cities make their methods typically face a trade-off challenge between accuracy and generality. In this research, we first advocate using the global open multi-source (GOMS) data within an advanced deep learning framework to break the trade-off. The GOMS data mainly refers to publicly available multi-type datasets, including road topology, building footprints, and population density, which can be consistently collected across cities. More importantly, these GOMS data are closely related to the traffic flow dynamics, thereby creating opportunities for accurate network-wide flow estimation. Furthermore, we use map images to represent GOMS data, instead of traditional tabular formats, to capture richer and more comprehensive geographical and demographic information. To address multi-source data fusion, we develop an attention-based graph neural network that effectively extracts and synthesizes information from GOMS maps while simultaneously capturing spatiotemporal traffic dynamics from observed traffic data. A large-scale case study across 15 cities in Europe and North America was conducted. The results demonstrate stable and satisfactory estimation accuracy across these cities, which suggests that the trade-off challenge can be successfully addressed using our approach.
{"title":"From global open multi-source data to network-wide traffic flow: A large-scale case study across multiple cities","authors":"Zijian Hu , Zhenjie Zheng , Monica Menendez , Wei Ma","doi":"10.1016/j.commtr.2025.100222","DOIUrl":"10.1016/j.commtr.2025.100222","url":null,"abstract":"<div><div>Network-wide traffic flow, which captures dynamic traffic volume on each link of a general network, is fundamental to smart mobility applications. However, the observed traffic flow from sensors is usually limited across the entire network due to the associated high installation and maintenance costs. To address this issue, existing research uses various supplementary data sources to compensate for insufficient sensor coverage and estimate the unobserved traffic flow. Although these studies have shown promising results, the inconsistent availability and quality of supplementary data across cities make their methods typically face a trade-off challenge between accuracy and generality. In this research, we first advocate using the global open multi-source (GOMS) data within an advanced deep learning framework to break the trade-off. The GOMS data mainly refers to publicly available multi-type datasets, including road topology, building footprints, and population density, which can be consistently collected across cities. More importantly, these GOMS data are closely related to the traffic flow dynamics, thereby creating opportunities for accurate network-wide flow estimation. Furthermore, we use map images to represent GOMS data, instead of traditional tabular formats, to capture richer and more comprehensive geographical and demographic information. To address multi-source data fusion, we develop an attention-based graph neural network that effectively extracts and synthesizes information from GOMS maps while simultaneously capturing spatiotemporal traffic dynamics from observed traffic data. A large-scale case study across 15 cities in Europe and North America was conducted. The results demonstrate stable and satisfactory estimation accuracy across these cities, which suggests that the trade-off challenge can be successfully addressed using our approach.</div></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":"5 ","pages":"Article 100222"},"PeriodicalIF":14.5,"publicationDate":"2025-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145571111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-18DOI: 10.1016/j.commtr.2025.100228
Chenchen Xu , Zongru Li , Hongbo He , Anqi Tang , Xiaohan Liao
The emerging low-altitude economy (LAE) hinges on effectively managing high-density aerial traffic flows. Establishing a system of low-altitude public air routes offers a feasible solution to handle this congestion. In this context, these routes are conceptualized as foundational “sky–road” infrastructure, and it is proposed that they be treated as fixed assets endowed with tradable or transferable property rights. Previous analysis suggests that building a public low-altitude air-route network can generate significant socioeconomic benefits, potentially beyond those of conventional ground transportation. Although “building sky roads” poses technological and regulatory challenges, extending the principles of terrestrial road networks into low-altitude airspace allows existing planning standards and governance mechanisms to be largely adapted to this new domain. This approach can transform many of these challenges into opportunities, laying the groundwork for a robust LAE in the future.
{"title":"Public air routes for low-altitude economies: Priority infrastructure beneficially associated with ground roads","authors":"Chenchen Xu , Zongru Li , Hongbo He , Anqi Tang , Xiaohan Liao","doi":"10.1016/j.commtr.2025.100228","DOIUrl":"10.1016/j.commtr.2025.100228","url":null,"abstract":"<div><div>The emerging low-altitude economy (LAE) hinges on effectively managing high-density aerial traffic flows. Establishing a system of low-altitude public air routes offers a feasible solution to handle this congestion. In this context, these routes are conceptualized as foundational “sky–road” infrastructure, and it is proposed that they be treated as fixed assets endowed with tradable or transferable property rights. Previous analysis suggests that building a public low-altitude air-route network can generate significant socioeconomic benefits, potentially beyond those of conventional ground transportation. Although “building sky roads” poses technological and regulatory challenges, extending the principles of terrestrial road networks into low-altitude airspace allows existing planning standards and governance mechanisms to be largely adapted to this new domain. This approach can transform many of these challenges into opportunities, laying the groundwork for a robust LAE in the future.</div></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":"5 ","pages":"Article 100228"},"PeriodicalIF":14.5,"publicationDate":"2025-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145571112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-15DOI: 10.1016/j.commtr.2025.100220
Yaotian Tan , Shuyue Qian , Aoyong Li , Haiyang Yu , Jie Gao
Ride-pooling has the potential to offer a sustainable solution for urban mobility by reducing vehicle use and emissions through shared trips. However, its adoption remains limited due to poor matching performance. Many requests fail to form feasible pools, and even successful matches often involve long detours or minimal cost savings. These inefficiencies largely arise from fragmented market structures: most operators act independently, restricting matching to their own request pools and limiting the formation of beneficial coalitions. Aggregation platforms improve efficiency by integrating regional operators through unified dispatch systems, but raise concerns over long-term stability. Differences in operator cost structures and market shares may incentivize deviation, at the same time, passengers may reject assigned payments if more attractive alternatives exist. To address these challenges, we propose a multi-level coalition formation game that jointly models operator and passenger collaboration. At the upper level, operators play a non-cooperative game to decide coalition partners. At the lower level, passengers are grouped into shared trips through a cooperative game that ensures individually rational payments. The two layers are coupled via constraint propagation, forming a unified decision-making process. We evaluate our framework using real-world data from three Chinese regions—Chengdu, Haikou, and the Ningxia Hui Autonomous Region—chosen to reflect diverse urban and regional contexts. Compared to independent operations, our approach increases vehicle occupancy by 14%–28%, reduces total costs by 10%–15%, and shortens average travel distances by 4%–5%. The system maintains stable coalition structures with operator deviation rates below 6.81% and near-zero passenger deviation rates.
{"title":"Efficient and stable ride-pooling through a multi-level coalition formation game","authors":"Yaotian Tan , Shuyue Qian , Aoyong Li , Haiyang Yu , Jie Gao","doi":"10.1016/j.commtr.2025.100220","DOIUrl":"10.1016/j.commtr.2025.100220","url":null,"abstract":"<div><div>Ride-pooling has the potential to offer a sustainable solution for urban mobility by reducing vehicle use and emissions through shared trips. However, its adoption remains limited due to poor matching performance. Many requests fail to form feasible pools, and even successful matches often involve long detours or minimal cost savings. These inefficiencies largely arise from fragmented market structures: most operators act independently, restricting matching to their own request pools and limiting the formation of beneficial coalitions. Aggregation platforms improve efficiency by integrating regional operators through unified dispatch systems, but raise concerns over long-term stability. Differences in operator cost structures and market shares may incentivize deviation, at the same time, passengers may reject assigned payments if more attractive alternatives exist. To address these challenges, we propose a multi-level coalition formation game that jointly models operator and passenger collaboration. At the upper level, operators play a non-cooperative game to decide coalition partners. At the lower level, passengers are grouped into shared trips through a cooperative game that ensures individually rational payments. The two layers are coupled via constraint propagation, forming a unified decision-making process. We evaluate our framework using real-world data from three Chinese regions—Chengdu, Haikou, and the Ningxia Hui Autonomous Region—chosen to reflect diverse urban and regional contexts. Compared to independent operations, our approach increases vehicle occupancy by 14%–28%, reduces total costs by 10%–15%, and shortens average travel distances by 4%–5%. The system maintains stable coalition structures with operator deviation rates below 6.81% and near-zero passenger deviation rates.</div></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":"5 ","pages":"Article 100220"},"PeriodicalIF":14.5,"publicationDate":"2025-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145571110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}