High-speed railway operations rely on various crew members. Among them, onboard mechanics are responsible for monitoring train systems and handling in-transit faults, bearing long working hours and critical safety responsibilities. However, they have received limited attention in existing crew rostering research, particularly those residing outside the base depot city. Additionally, the crew rostering plan often requires adjustments during execution, due to foreseeable disruptions such as leave requests, training courses, and additional tasks. Yet, these practical issues are often ignored, with adjustments mainly made manually and without a systematic correction approach. To address these gaps, this paper first proposes a hybrid service pattern and a mathematical model to design more reasonable crew routes and provide more convenient task arrangements for onboard mechanics. Following this, a rolling optimisation model is introduced to address foreseeable disruptions during the execution of the rostering plan, aiming to minimise plan modifications while maintaining balanced workloads. The relationship between the two models is sequential, with the crew route information obtained from the first model serving as partial input for the second model. A real-world case study based on data from the Qingdao EMU Depot in China is conducted to validate the effectiveness of the proposed models, with Gurobi used for solving. The computational results show that the crew routes are well assessed and balanced in terms of both operational costs and work convenience. Furthermore, the rolling optimisation model achieves a significantly lower modification-to-disruption ratio than the manual approach, ensuring greater robustness against disruptions. It further improves workload balance, reduces commuting costs, and prevents overwork, offering a practical and efficient solution for real-world planning.
{"title":"A Rolling Optimisation Approach for High-Speed Railway Crew Rostering","authors":"Wenjian Zhong, Boliang Lin, Zheng Gao","doi":"10.1049/itr2.70120","DOIUrl":"10.1049/itr2.70120","url":null,"abstract":"<p>High-speed railway operations rely on various crew members. Among them, onboard mechanics are responsible for monitoring train systems and handling in-transit faults, bearing long working hours and critical safety responsibilities. However, they have received limited attention in existing crew rostering research, particularly those residing outside the base depot city. Additionally, the crew rostering plan often requires adjustments during execution, due to foreseeable disruptions such as leave requests, training courses, and additional tasks. Yet, these practical issues are often ignored, with adjustments mainly made manually and without a systematic correction approach. To address these gaps, this paper first proposes a hybrid service pattern and a mathematical model to design more reasonable crew routes and provide more convenient task arrangements for onboard mechanics. Following this, a rolling optimisation model is introduced to address foreseeable disruptions during the execution of the rostering plan, aiming to minimise plan modifications while maintaining balanced workloads. The relationship between the two models is sequential, with the crew route information obtained from the first model serving as partial input for the second model. A real-world case study based on data from the Qingdao EMU Depot in China is conducted to validate the effectiveness of the proposed models, with Gurobi used for solving. The computational results show that the crew routes are well assessed and balanced in terms of both operational costs and work convenience. Furthermore, the rolling optimisation model achieves a significantly lower modification-to-disruption ratio than the manual approach, ensuring greater robustness against disruptions. It further improves workload balance, reduces commuting costs, and prevents overwork, offering a practical and efficient solution for real-world planning.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":"19 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.70120","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145686071","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Merging behaviours in work zones pose significant traffic management challenges due to lane closures that create bottlenecks and increase accident risk. In mixed traffic environments involving emergency vehicles (EVs), connected automated vehicles (CAVs), and human-driven vehicles, addressing these challenges becomes more complex. EVs, in particular, require priority movement to minimize response times, but their movement is often hindered by traditional traffic management strategies. While previous merging strategies have shown promising results in managing traffic flow, they fail to account for the unique challenges posed by different vehicle types in work zone environments. In this paper, we propose a new reward weight adjustment method for multi-agent proximal policy optimization based CAVs in work zone for emergency vehicles (MAPPO-WEV). The proposed method improves EV's response times without compromising travel time of other vehicles. MAPPO-WEV introduces a dynamic reward weighting mechanism that adjusts the importance weight of speed, headway, and merging behaviour based on the type and number of vehicles. This approach allows EVs to travel more freely while maintaining safety in mixed traffic conditions. The simulation results of MAPPO-WEV show significant improvements in both travel times and waiting times of EVs by 25% and 33% respectively compared to the Baseline method.
{"title":"Efficient Merging at Work Zones to Support Emergency Response in Mixed Traffic Environments: A Reward Weight Adjustment Method for Multi-Agent Reinforcement Learning","authors":"Fatemeh Bandarian, Saeedeh Ghanadbashi, Abdollah Malekjafarian, Fatemeh Golpayegani","doi":"10.1049/itr2.70121","DOIUrl":"10.1049/itr2.70121","url":null,"abstract":"<p>Merging behaviours in work zones pose significant traffic management challenges due to lane closures that create bottlenecks and increase accident risk. In mixed traffic environments involving emergency vehicles (EVs), connected automated vehicles (CAVs), and human-driven vehicles, addressing these challenges becomes more complex. EVs, in particular, require priority movement to minimize response times, but their movement is often hindered by traditional traffic management strategies. While previous merging strategies have shown promising results in managing traffic flow, they fail to account for the unique challenges posed by different vehicle types in work zone environments. In this paper, we propose a new reward weight adjustment method for multi-agent proximal policy optimization based CAVs in work zone for emergency vehicles (MAPPO-WEV). The proposed method improves EV's response times without compromising travel time of other vehicles. MAPPO-WEV introduces a dynamic reward weighting mechanism that adjusts the importance weight of speed, headway, and merging behaviour based on the type and number of vehicles. This approach allows EVs to travel more freely while maintaining safety in mixed traffic conditions. The simulation results of MAPPO-WEV show significant improvements in both travel times and waiting times of EVs by 25% and 33% respectively compared to the Baseline method.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":"19 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.70121","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145686460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The safety decisions of autonomous driving systems rely on the accurate understanding of 3D scenes, and the existing 3D occupancy prediction (OCC) models are difficult to meet the requirements of in-vehicle deployment due to their high computational complexity and a large number of parameters. Traditional methods (e.g., OccWorld, FlashOcc) rely on full-precision floating-point operations and dense 3D convolution, resulting in hundreds of millions of model parameters. In this paper, we propose a lightweight two-branch binarization network, TBBOcc, to break through the bottleneck of ‘efficiency-accuracy’ trade-off through multi-technology co-optimization. First, we design two-branch binarized feature extraction, using channel compression and hyperbolic tangent relaxation activation function to alleviate the problem of vanishing binarized gradient, which reduces the computation amount while retaining the key geometrical information; second, we improve the EfficientViM module by integrating state space modeling and a two-dimensional normalization strategy, which enhances the ability of global temporal feature modeling; and lastly, we introduce a dynamic temporal fusion mechanism, combining binocular depth estimation with deformable BEV pooling to capture the spatio-temporal evolution laws. Experiments show that TBBOcc achieves 39.1% mean intersection over union (mIoU) on the Occ3D-nuScenes validation set with 32.8 M parameter counts and 164.8 G FLOPs, which reduces the amount of parameters by 26.6%, computation by 33.7%, and improves the accuracy by 3.3% compared with the baseline model FlashOcc. Especially, it performs well in dynamic obstacles (e.g., pedestrians, traffic cones) and complex scenes. In this paper, binarization computation is introduced into the 3D OCC task for the first time, which provides an efficient and reliable technical path for real-time environment sensing for autonomous driving.
{"title":"TBBOcc: A Lightweight Twin-Branch Binarized Network for Efficient 3D Semantic Occupancy Prediction in Autonomous Driving","authors":"Yichen Zhang, Junyi Geng","doi":"10.1049/itr2.70122","DOIUrl":"10.1049/itr2.70122","url":null,"abstract":"<p>The safety decisions of autonomous driving systems rely on the accurate understanding of 3D scenes, and the existing 3D occupancy prediction (OCC) models are difficult to meet the requirements of in-vehicle deployment due to their high computational complexity and a large number of parameters. Traditional methods (e.g., OccWorld, FlashOcc) rely on full-precision floating-point operations and dense 3D convolution, resulting in hundreds of millions of model parameters. In this paper, we propose a lightweight two-branch binarization network, TBBOcc, to break through the bottleneck of ‘efficiency-accuracy’ trade-off through multi-technology co-optimization. First, we design two-branch binarized feature extraction, using channel compression and hyperbolic tangent relaxation activation function to alleviate the problem of vanishing binarized gradient, which reduces the computation amount while retaining the key geometrical information; second, we improve the EfficientViM module by integrating state space modeling and a two-dimensional normalization strategy, which enhances the ability of global temporal feature modeling; and lastly, we introduce a dynamic temporal fusion mechanism, combining binocular depth estimation with deformable BEV pooling to capture the spatio-temporal evolution laws. Experiments show that TBBOcc achieves 39.1% mean intersection over union (mIoU) on the Occ3D-nuScenes validation set with 32.8 M parameter counts and 164.8 G FLOPs, which reduces the amount of parameters by 26.6%, computation by 33.7%, and improves the accuracy by 3.3% compared with the baseline model FlashOcc. Especially, it performs well in dynamic obstacles (e.g., pedestrians, traffic cones) and complex scenes. In this paper, binarization computation is introduced into the 3D OCC task for the first time, which provides an efficient and reliable technical path for real-time environment sensing for autonomous driving.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":"19 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.70122","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145619327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
To enhance the robustness and interpretability of road-accident prediction under sparse, noisy, and dynamically evolving conditions, this study proposes a Multimodal Grey-Markov and Adversarial Meta-Learning (MGMC-AML) framework. The model integrates grey relational analysis for adaptive modality weighting, dynamic Markov state modelling for temporal-spatial transition learning, and adversarial meta-optimisation for rapid recovery from perturbations. A reinforcement-enhanced dynamic partitioning mechanism is introduced to maintain structural consistency of road-network topology during fluctuating traffic states. Extensive experiments on multi-source traffic and weather datasets demonstrate that the proposed framework achieves superior predictive performance, with a Mean Absolute Error (MAE) of 2.34 incidents per day, a Segmentation Consistency Index (SCI) of 0.85, and a Modular Q value of 0.78, while maintaining an attack-recovery time of 162 s. These results surpass state-of-the-art baselines, including LSTM, GNN, and Transformer models, confirming both its precision and resilience under adversarial or uncertain sensing conditions. The proposed approach offers a unified and reproducible framework that bridges uncertainty modelling, adaptive fusion, and robust optimisation, providing a theoretical and practical foundation for resilient traffic-risk forecasting in intelligent-transportation systems.
{"title":"Collaborative Optimisation of Grey-Markov Modelling and Adversarial Meta-Learning for Resilient Intelligent Transportation Systems","authors":"Jingli Jia, Jiqiang Zhang, Yongfang Zhu","doi":"10.1049/itr2.70119","DOIUrl":"10.1049/itr2.70119","url":null,"abstract":"<p>To enhance the robustness and interpretability of road-accident prediction under sparse, noisy, and dynamically evolving conditions, this study proposes a Multimodal Grey-Markov and Adversarial Meta-Learning (MGMC-AML) framework. The model integrates grey relational analysis for adaptive modality weighting, dynamic Markov state modelling for temporal-spatial transition learning, and adversarial meta-optimisation for rapid recovery from perturbations. A reinforcement-enhanced dynamic partitioning mechanism is introduced to maintain structural consistency of road-network topology during fluctuating traffic states. Extensive experiments on multi-source traffic and weather datasets demonstrate that the proposed framework achieves superior predictive performance, with a Mean Absolute Error (MAE) of 2.34 incidents per day, a Segmentation Consistency Index (SCI) of 0.85, and a Modular Q value of 0.78, while maintaining an attack-recovery time of 162 s. These results surpass state-of-the-art baselines, including LSTM, GNN, and Transformer models, confirming both its precision and resilience under adversarial or uncertain sensing conditions. The proposed approach offers a unified and reproducible framework that bridges uncertainty modelling, adaptive fusion, and robust optimisation, providing a theoretical and practical foundation for resilient traffic-risk forecasting in intelligent-transportation systems.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":"19 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.70119","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145686461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Given that constant-parameter model predictive control (MPC)-based automatic emergency braking (AEB) systems are unable to simultaneously balance comfort, safety, and computational efficiency, this paper proposes an adaptive optimization strategy for MPC that adjusts weights and sampling times to address this issue. First, a three-level warning strategy based on a safety distance model is introduced. This strategy assesses the risk level during vehicle operation using an emergency coefficient and adaptively adjusts the sampling time. By analysing the correlation between relative distance, speed, and injury risk, weight adjustment rules based on injury risk are determined. Second, a fuzzy regulator is developed with the emergency coefficient, injury risk, and relative distance as inputs is developed to enable dynamic adjustment of weights and sampling time in response to operational conditions. Finally, an AEB control strategy is designed based on hierarchical control principles: the upper layer uses MPC to achieve multi-objective optimization, while the lower layer employs PID correction to track the desired acceleration. In the test scenarios, joint simulation experiments were conducted using CarSim and MATLAB/Simulink, and the results under four scenarios and operating conditions were analysed and compared. The results show that the proposed control strategy enhances comfort while ensuring AEB safety control, reducing the average braking distance deviation by 11.80% and the average acceleration deviation by 48.91%. These improvements are significant for enhancing AEB performance without hardware modifications.
{"title":"Adaptive MPC-Based AEB Control Strategy with Dynamic Weight and Sampling Time Adjustment","authors":"Liang Zhang, Bin Ma, Penghui Li","doi":"10.1049/itr2.70112","DOIUrl":"10.1049/itr2.70112","url":null,"abstract":"<p>Given that constant-parameter model predictive control (MPC)-based automatic emergency braking (AEB) systems are unable to simultaneously balance comfort, safety, and computational efficiency, this paper proposes an adaptive optimization strategy for MPC that adjusts weights and sampling times to address this issue. First, a three-level warning strategy based on a safety distance model is introduced. This strategy assesses the risk level during vehicle operation using an emergency coefficient and adaptively adjusts the sampling time. By analysing the correlation between relative distance, speed, and injury risk, weight adjustment rules based on injury risk are determined. Second, a fuzzy regulator is developed with the emergency coefficient, injury risk, and relative distance as inputs is developed to enable dynamic adjustment of weights and sampling time in response to operational conditions. Finally, an AEB control strategy is designed based on hierarchical control principles: the upper layer uses MPC to achieve multi-objective optimization, while the lower layer employs PID correction to track the desired acceleration. In the test scenarios, joint simulation experiments were conducted using CarSim and MATLAB/Simulink, and the results under four scenarios and operating conditions were analysed and compared. The results show that the proposed control strategy enhances comfort while ensuring AEB safety control, reducing the average braking distance deviation by 11.80% and the average acceleration deviation by 48.91%. These improvements are significant for enhancing AEB performance without hardware modifications.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":"19 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.70112","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145619249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Li Li, Yu-Tao Liu, Er-Long Tan, Li-Yong Zheng, Run-Min Wang
Traditional methods of vehicle trajectory reconstruction heavily rely on the data of cross-sectional traffic detectors, but the effectiveness of existing methods is limited by insufficient information of the cross-sectional data. In response to this, this study proposes a novel trajectory reconstruction method based on long-range traffic detectors. It builds upon Newell's car-following model and its derived inverse following model. By taking driver heterogeneity into account through individualised calibration of the key parameter, namely the spatial shift, which is optimised by the whale optimisation algorithm, the accuracy of trajectory reconstruction is enhanced. Furthermore, to connect trajectories of the same vehicle in the same area that are reconstructed by adjacent long-range detectors, a particle filter-based trajectory fusion method is developed. It can fuse overlapped reconstructed trajectories and smoothly connect sectional trajectories into a complete and seamlessly connected one. The performance of the trajectory reconstruction method is evaluated on the NGSIM I-80 dataset, while the trajectory fusion method was tested on both the I-80 and the TRJD TS datasets. Results show that the reconstruction method generates complete vehicle trajectories across various traffic flow conditions, achieving an average of 28.65% reduction in mean absolute error compared to methods that do not account for driver heterogeneity. The mean absolute error of the fused trajectories was reduced by 49.23% and 59.69% on average for two datasets, respectively, compared to reconstructed trajectories using a single detector. The trajectory reconstruction accuracy of the proposed method also outperforms that of a deep convolutional neural network and an improved adaptive smoothing method.
{"title":"Heterogeneous Driver-Aware Vehicle Trajectory Reconstruction and Fusion for Multiple Long-Range Traffic Detectors","authors":"Li Li, Yu-Tao Liu, Er-Long Tan, Li-Yong Zheng, Run-Min Wang","doi":"10.1049/itr2.70116","DOIUrl":"10.1049/itr2.70116","url":null,"abstract":"<p>Traditional methods of vehicle trajectory reconstruction heavily rely on the data of cross-sectional traffic detectors, but the effectiveness of existing methods is limited by insufficient information of the cross-sectional data. In response to this, this study proposes a novel trajectory reconstruction method based on long-range traffic detectors. It builds upon Newell's car-following model and its derived inverse following model. By taking driver heterogeneity into account through individualised calibration of the key parameter, namely the spatial shift, which is optimised by the whale optimisation algorithm, the accuracy of trajectory reconstruction is enhanced. Furthermore, to connect trajectories of the same vehicle in the same area that are reconstructed by adjacent long-range detectors, a particle filter-based trajectory fusion method is developed. It can fuse overlapped reconstructed trajectories and smoothly connect sectional trajectories into a complete and seamlessly connected one. The performance of the trajectory reconstruction method is evaluated on the NGSIM I-80 dataset, while the trajectory fusion method was tested on both the I-80 and the TRJD TS datasets. Results show that the reconstruction method generates complete vehicle trajectories across various traffic flow conditions, achieving an average of 28.65% reduction in mean absolute error compared to methods that do not account for driver heterogeneity. The mean absolute error of the fused trajectories was reduced by 49.23% and 59.69% on average for two datasets, respectively, compared to reconstructed trajectories using a single detector. The trajectory reconstruction accuracy of the proposed method also outperforms that of a deep convolutional neural network and an improved adaptive smoothing method.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":"19 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.70116","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145619250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this study, we introduced a multi-task deep learning framework that concurrently forecasts traffic accident risk and severity by integrating convolutional neural networks (CNNs), bidirectional long short-term memory (BiLSTM) units, and a self-attention mechanism. Unlike conventional single-task approaches, our model leverages shared spatiotemporal representations to capture complex patterns in traffic data, thereby enhancing both predictive accuracy and generalizability. Evaluations on large-scale datasets from New York City and Chicago demonstrate that our approach achieves high accuracy (up to 92% for accident risk and 89% for severity) and remains robust across diverse urban contexts. Moreover, an enhanced SHAP-based interpretability module provides granular insights into the influence of both observable and latent factors, such as driver behaviour or road surface conditions, on prediction outcomes. The self-attention mechanism further mitigates unobserved heterogeneity by highlighting critical time steps and feature interactions. With competitive real-time performance and throughput, our framework offers a practical solution for dynamic traffic safety applications. Future work will focus on extending evaluations to broader urban settings and integrating latent variable models to better quantify unobserved influences, ultimately advancing the development of safer, more efficient transportation systems.
{"title":"A Multi-Task ConvoBiLSTM Model With Self-Attention for Concurrent Forecasting of Traffic Accident Risk and Severity","authors":"Auwal Sagir Muhammad, Longbiao Chen, Cheng Wang","doi":"10.1049/itr2.70108","DOIUrl":"10.1049/itr2.70108","url":null,"abstract":"<p>In this study, we introduced a multi-task deep learning framework that concurrently forecasts traffic accident risk and severity by integrating convolutional neural networks (CNNs), bidirectional long short-term memory (BiLSTM) units, and a self-attention mechanism. Unlike conventional single-task approaches, our model leverages shared spatiotemporal representations to capture complex patterns in traffic data, thereby enhancing both predictive accuracy and generalizability. Evaluations on large-scale datasets from New York City and Chicago demonstrate that our approach achieves high accuracy (up to 92% for accident risk and 89% for severity) and remains robust across diverse urban contexts. Moreover, an enhanced SHAP-based interpretability module provides granular insights into the influence of both observable and latent factors, such as driver behaviour or road surface conditions, on prediction outcomes. The self-attention mechanism further mitigates unobserved heterogeneity by highlighting critical time steps and feature interactions. With competitive real-time performance and throughput, our framework offers a practical solution for dynamic traffic safety applications. Future work will focus on extending evaluations to broader urban settings and integrating latent variable models to better quantify unobserved influences, ultimately advancing the development of safer, more efficient transportation systems.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":"19 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.70108","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145618887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Doreen Sebastian Sarwatt, Frank Kulwa, Huansheng Ning, Adamu Gaston Philipo, Xuanxia Yao, Jianguo Ding
<p>Autonomous vehicles (AVs) depend critically on vision-based perception systems, with traffic sign classification (TSC) playing a crucial role in interpreting regulatory and warning signs for safe navigation. However, these systems are highly vulnerable to adversarial attacks, subtle input perturbations that deceive deep learning models while appearing benign to human drivers. While detection has been the primary focus of defense, recovery of adversarial perturbed signs remains significantly underexplored, despite its importance for maintaining real-time decision-making and operational safety. To bridge this gap, we present the first comprehensive benchmarking of state-of-the-art image classification recovery methods adapted to the traffic sign domain. We address three domain-specific challenges for autonomous driving: (1) robustness to real-world conditions (e.g., weather, occlusion), (2) latency compatible with real-time pipelines (100 ms), and (3) preservation of geometric/structural integrity. Our adaptations combine weather-resilient preprocessing, shape-preserving restoration, and latency-aware implementation. Under unified white-box attacks, we evaluate across TSRD, BTSC, and GTSRB using recovery rate (RR), structural similarity (SSIM), and recovery time (RT). To connect latency to function, we introduce the recovery-induced distance (RID), which maps recovery time (RT) to added travel distance. PuVAE, VAE, c-GAN, and CD-GAN achieve subfewmillisecond RT with <span></span><math>