Congcong Bai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Congcong Bai has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Sheng Jin
Institute of Intelligent Transportation Systems, College of Civil Engineering and Architecture, Zhejiang University, Hangzhou 310058, China
10 shared publications - Wenbin Yao
School of Civil Engineering and Architecture, Zhejiang Sci-Tech University, Hangzhou 310018, China
8 shared publications - Donglei Rong
Institute of Intelligent Transportation Systems, College of Civil Engineering and Architecture, Zhejiang University, Hangzhou, China
6 shared publications Chengcheng Yang
3 shared publications- Chengcheng Yang
Institute of Intelligent Transportation Systems, College of Civil Engineering and Architecture, Zhejiang University, Hangzhou, China
3 shared publications Adjé Jérémie Alagbé
Institute of Intelligent Transportation Systems, College of Civil Engineering and Architecture, Zhejiang University, Hangzhou, China
2 shared publications
Latest Publications
- 27 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. PP (21682216) , 1-14
Physically Informed Driving Style Recognition for Intelligent Vehicle Assistance
Recognizing driving styles is essential for enhancing advanced driver-assistance systems (ADASs), as it enables the provision of personalized driving experiences while improving road safety. Although trajectory-based driving style recognition has been widely studied, existing approaches often rely on behavioral statistical features, single-model parameters, or latent representations, which may compromise interpretability and cross-scenario generalizability. To bridge this gap, this article proposes a physically informed framework for driving style recognition that integrates multiple physical car-following models with data-driven clustering and classification techniques. The framework extracts driving preferences from vehicle trajectory data by calibrating parameters across multiple physical car-following models and identifying key style-discriminative features. This approach enhances the interpretability and robustness of trajectory-based representation while reducing reliance on sparse in-vehicle sensor data. Experimental results reveal three behaviorally distinct driving styles—cautious efficient, aggressive efficient, and conservative safe—each reflecting distinct tradeoffs among efficiency, safety, and stability. The extracted rules exhibit high classification accuracy and generalizability across datasets, forming a solid basis for style-aware ADAS strategies. The proposed framework offers an interpretable and transferable trajectory-based solution for scalable driving style analysis, offering a solid foundation for intelligent vehicle assistance.
- 27 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. PP (21682216) , 1-14
Physically Informed Driving Style Recognition for Intelligent Vehicle Assistance
Recognizing driving styles is essential for enhancing advanced driver-assistance systems (ADASs), as it enables the provision of personalized driving experiences while improving road safety. Although trajectory-based driving style recognition has been widely studied, existing approaches often rely on behavioral statistical features, single-model parameters, or latent representations, which may compromise interpretability and cross-scenario generalizability. To bridge this gap, this article proposes a physically informed framework for driving style recognition that integrates multiple physical car-following models with data-driven clustering and classification techniques. The framework extracts driving preferences from vehicle trajectory data by calibrating parameters across multiple physical car-following models and identifying key style-discriminative features. This approach enhances the interpretability and robustness of trajectory-based representation while reducing reliance on sparse in-vehicle sensor data. Experimental results reveal three behaviorally distinct driving styles—cautious efficient, aggressive efficient, and conservative safe—each reflecting distinct tradeoffs among efficiency, safety, and stability. The extracted rules exhibit high classification accuracy and generalizability across datasets, forming a solid basis for style-aware ADAS strategies. The proposed framework offers an interpretable and transferable trajectory-based solution for scalable driving style analysis, offering a solid foundation for intelligent vehicle assistance.
- Open Access
- 12 May 2026
- Published by Elsevier in SSRN Electronic Journal
Understanding the Mechanism of Gap-Acceptance Behavior at Roundabouts: A Cumulative Prospect Theory and Drift-Diffusion Model Framework
Gap-acceptance at roundabout entries is a safety-critical driver behavior with direct implications for intersection capacity analysis, microscopic traffic simulation, and the development of autonomous driving systems. Existing models either treat the decision as a static threshold comparison, limiting their ability to capture behavioral heterogeneity and context dependence, or rely on data-driven methods that achieve strong predictive performance at the cost of interpretability and mechanistic insight. This study proposes a unified behavioral framework that couples cumulative prospect theory (CPT) with the drift diffusion model (DDM) for gap-acceptance decisions at roundabout entries. The CPT module translates observable traffic states into a time-varying subjective value difference between entering and waiting, capturing loss aversion and probability distortion as systematic features of driver risk perception. This value difference drives the drift rate of the DDM module, in which entry commitment accumulates stochastically over time until accumulated evidence reaches the decision boundary. A simulation-based maximum likelihood (SML) estimator combined with a differential evolution (DE) optimizer jointly identifies all five model parameters from naturalistic trajectory data, with gaps that expire without entry treated as right-censored observations from a survival perspective. The framework is evaluated on the Citysim trajectory dataset against five baseline models spanning four established modelling paradigms. Results show that the proposed framework achieves superior performance in both gap decision behavior prediction and entry timing prediction across all distance windows, with an accuracy of 87.83% and a Hit@1.0s of 88.0% at the full 30–0 m window. The estimated parameters reveal that drivers at roundabout entries exhibit substantially higher loss aversion and stronger probability distortion than general behavioral economics benchmarks, and the framework reproduces the hesitation-then-commit kinematic signature observed in naturalistic driving data, providing mechanistic insights that purely predictive models cannot offer.
- 12 May 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessUnderstanding the Mechanism of Gap-Acceptance Behavior at Roundabouts: A Cumulative Prospect Theory and Drift-Diffusion Model Framework
Gap-acceptance at roundabout entries is a safety-critical driver behavior with direct implications for intersection capacity analysis, microscopic traffic simulation, and the development of autonomous driving systems. Existing models either treat the decision as a static threshold comparison, limiting their ability to capture behavioral heterogeneity and context dependence, or rely on data-driven methods that achieve strong predictive performance at the cost of interpretability and mechanistic insight. This study proposes a unified behavioral framework that couples cumulative prospect theory (CPT) with the drift diffusion model (DDM) for gap-acceptance decisions at roundabout entries. The CPT module translates observable traffic states into a time-varying subjective value difference between entering and waiting, capturing loss aversion and probability distortion as systematic features of driver risk perception. This value difference drives the drift rate of the DDM module, in which entry commitment accumulates stochastically over time until accumulated evidence reaches the decision boundary. A simulation-based maximum likelihood (SML) estimator combined with a differential evolution (DE) optimizer jointly identifies all five model parameters from naturalistic trajectory data, with gaps that expire without entry treated as right-censored observations from a survival perspective. The framework is evaluated on the Citysim trajectory dataset against five baseline models spanning four established modelling paradigms. Results show that the proposed framework achieves superior performance in both gap decision behavior prediction and entry timing prediction across all distance windows, with an accuracy of 87.83% and a Hit@1.0s of 88.0% at the full 30–0 m window. The estimated parameters reveal that drivers at roundabout entries exhibit substantially higher loss aversion and stronger probability distortion than general behavioral economics benchmarks, and the framework reproduces the hesitation-then-commit kinematic signature observed in naturalistic driving data, providing mechanistic insights that purely predictive models cannot offer.
- 7 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-13
Safe and Interactive Integration of Prediction and Planning for Autonomous Vehicles with Residual Chain Loss
The Integration of Prediction and Planning (IPP) methodology enhances interrelationships between autonomous vehicle modules while improving system interpretability. However, safety, interaction, and performance evaluation present significant challenges that may lead to safety risks. This paper introduces IPP* (Safe and Interactive Integration of Prediction and Planning with Residual Chain Loss), a framework that addresses these challenges through three key components. First, a safety judgment module employs rule-based methods to assess prediction trustworthiness and ensure stability before planning. Second, a Nash Equilibrium-based approach facilitates iterative refinement between prediction and planning modules, creating a game-theoretic framework that enables mutual learning and system optimization. Third, a Residual Chain Loss Function addresses covariate bias in imitation learning by analyzing disparities between predicted and planned trajectories. The results indicate that IPP* achieves an Average Displacement Error (ADE) of 0.74 m and a Final Displacement Error (FDE) of 0.89 m, and delivers an average L2 distance (L2) of 0.44 m with an average Collision Rate (CR) of 0.27%. Ablation results further verify the complementary contributions of the safety judgment module, the game-based interaction module, and the residual chain loss function, while sensitivity analyses over key thresholds and loss weights indicate stable behavior and clarify safety–performance trade-offs.
- 7 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-13
Safe and Interactive Integration of Prediction and Planning for Autonomous Vehicles with Residual Chain Loss
The Integration of Prediction and Planning (IPP) methodology enhances interrelationships between autonomous vehicle modules while improving system interpretability. However, safety, interaction, and performance evaluation present significant challenges that may lead to safety risks. This paper introduces IPP* (Safe and Interactive Integration of Prediction and Planning with Residual Chain Loss), a framework that addresses these challenges through three key components. First, a safety judgment module employs rule-based methods to assess prediction trustworthiness and ensure stability before planning. Second, a Nash Equilibrium-based approach facilitates iterative refinement between prediction and planning modules, creating a game-theoretic framework that enables mutual learning and system optimization. Third, a Residual Chain Loss Function addresses covariate bias in imitation learning by analyzing disparities between predicted and planned trajectories. The results indicate that IPP* achieves an Average Displacement Error (ADE) of 0.74 m and a Final Displacement Error (FDE) of 0.89 m, and delivers an average L2 distance (L2) of 0.44 m with an average Collision Rate (CR) of 0.27%. Ablation results further verify the complementary contributions of the safety judgment module, the game-based interaction module, and the residual chain loss function, while sensitivity analyses over key thresholds and loss weights indicate stable behavior and clarify safety–performance trade-offs.
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 7049-7064
HybridLoss—An Adaptive Planning-Oriented Loss Function for End-to-End Autonomous Vehicle
Autonomous driving often suffer from a decoupled feedback loop between prediction and planning. While prediction losses focus on the accuracy of surrounding agents, planning losses typically imitate recorded Autonomous Vehicles’ (AVs) trajectories that may contain suboptimal or aggressive behaviors, leading to unstable interactions in mixed traffic. This paper presents HybridLoss, an adaptive planning-oriented objective that unifies prediction and planning through planner-in-the-loop supervision and interaction-aware consistency. HybridLoss integrates an adaptive motion-planning module which replaces ground-truth targets with optimized reference trajectories, and a multi-term loss combining prediction, adaptive planning, safety potential, and social force objectives. Evaluations on the INTERACTION dataset indicate that HybridLoss significantly outperforms strong baselines. Beyond standard metric improvements—reducing ADE/FDE from 1.36/1.64 m to 1.11/1.36 m and collision rates from 0.19% to 0.11%—extensive stress-testing reveals superior system maturity. First, HybridLoss exhibits the highest robustness under input perturbations, maintaining the lowest planning deviation and endpoint standard deviation. Second, it demonstrates strong generalization, maintaining stable success rates (87.7%) in unseen scenarios with high computational efficiency (64.3 Hz). Third, multi-objective analysis confirms that HybridLoss achieves the optimal Pareto trade-off between efficiency, safety, and comfort, avoiding the speed-safety collapse seen in baseline methods. Finally, social force evaluations highlight that HybridLoss fosters implicit cooperation, achieving higher yield rates and reduced conflict indices while maintaining safe interaction buffers. These results validate HybridLoss as a robust, socially compliant, and adaptive solution for end-to-end driving.
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 7049-7064
HybridLoss—An Adaptive Planning-Oriented Loss Function for End-to-End Autonomous Vehicle
Autonomous driving often suffer from a decoupled feedback loop between prediction and planning. While prediction losses focus on the accuracy of surrounding agents, planning losses typically imitate recorded Autonomous Vehicles’ (AVs) trajectories that may contain suboptimal or aggressive behaviors, leading to unstable interactions in mixed traffic. This paper presents HybridLoss, an adaptive planning-oriented objective that unifies prediction and planning through planner-in-the-loop supervision and interaction-aware consistency. HybridLoss integrates an adaptive motion-planning module which replaces ground-truth targets with optimized reference trajectories, and a multi-term loss combining prediction, adaptive planning, safety potential, and social force objectives. Evaluations on the INTERACTION dataset indicate that HybridLoss significantly outperforms strong baselines. Beyond standard metric improvements—reducing ADE/FDE from 1.36/1.64 m to 1.11/1.36 m and collision rates from 0.19% to 0.11%—extensive stress-testing reveals superior system maturity. First, HybridLoss exhibits the highest robustness under input perturbations, maintaining the lowest planning deviation and endpoint standard deviation. Second, it demonstrates strong generalization, maintaining stable success rates (87.7%) in unseen scenarios with high computational efficiency (64.3 Hz). Third, multi-objective analysis confirms that HybridLoss achieves the optimal Pareto trade-off between efficiency, safety, and comfort, avoiding the speed-safety collapse seen in baseline methods. Finally, social force evaluations highlight that HybridLoss fosters implicit cooperation, achieving higher yield rates and reduced conflict indices while maintaining safe interaction buffers. These results validate HybridLoss as a robust, socially compliant, and adaptive solution for end-to-end driving.
- 14 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (11) , 19845-19861
A Robust Method for Bus Scheduling and Passenger Flow Coordination Considering Arterial Signal Coordination Under Connected Environment
Urban public transportation is a complex and open system integral to urban mobility. Its operation is often disrupted by various random factors, necessitating robust scheduling solutions. This study develops a bus robust scheduling model based on mixed-integer linear programming to enhance system resilience. First, an arterial signal coordination model is proposed for mixed traffic environments, enabling autonomous public transport vehicles to traverse intersections without stopping. Second, a demand-deterministic bus scheduling model is constructed, integrating timetables, trajectories, and origin-destination transfer schemes to balance passenger waiting time fairness and efficiency. Third, to address stochastic passenger demand during actual operations, a robust bus scheduling model is developed by incorporating robust constraints. Numerical experiments demonstrate that the demand-deterministic model generates optimal scheduling schemes when passenger demand remains within bus capacity. However, when passenger demand exceeds capacity, the demand-deterministic model becomes infeasible. In such scenarios, the robust scheduling model produces feasible schemes, albeit with reduced optimization, and its robustness can be tuned by adjusting model parameters. Additionally, practical management insights are provided for real-world applications.
- 14 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (11) , 19845-19861
A Robust Method for Bus Scheduling and Passenger Flow Coordination Considering Arterial Signal Coordination Under Connected Environment
Urban public transportation is a complex and open system integral to urban mobility. Its operation is often disrupted by various random factors, necessitating robust scheduling solutions. This study develops a bus robust scheduling model based on mixed-integer linear programming to enhance system resilience. First, an arterial signal coordination model is proposed for mixed traffic environments, enabling autonomous public transport vehicles to traverse intersections without stopping. Second, a demand-deterministic bus scheduling model is constructed, integrating timetables, trajectories, and origin-destination transfer schemes to balance passenger waiting time fairness and efficiency. Third, to address stochastic passenger demand during actual operations, a robust bus scheduling model is developed by incorporating robust constraints. Numerical experiments demonstrate that the demand-deterministic model generates optimal scheduling schemes when passenger demand remains within bus capacity. However, when passenger demand exceeds capacity, the demand-deterministic model becomes infeasible. In such scenarios, the robust scheduling model produces feasible schemes, albeit with reduced optimization, and its robustness can be tuned by adjusting model parameters. Additionally, practical management insights are provided for real-world applications.
- 26 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 12512-12525
Multi-Vehicle Collaborative Trajectory Planning Based on Kaldor-Hicks Improvement
This paper employs lateral and longitudinal trajectory planning to generate candidate trajectories and discards those that do not satisfy the constraints imposed by single-vehicle conditions. Next, a collaborative trajectory combination set for multiple vehicles is derived from the candidate trajectories, with multi-vehicle constraints applied to eliminate combinations that fail to meet the required conditions. The objective function for each candidate trajectory set is first calculated using a single-vehicle objective function, after which a multi-vehicle objective function based on the Kaldor-Hicks improvement principle is constructed. Finally, the paper introduces an improved particle swarm optimization method for multi-vehicle collaborative trajectory planning. The results demonstrate that the dynamic spatiotemporal occupancy growth rate, under varying planning times and frequencies, is at least 19%. Furthermore, the proposed algorithm ensures efficient allocation of travel resources, preventing competition among vehicles that could compromise system feasibility. When verified with HighD trajectory data, the algorithm not only delivers superior optimization results but also exhibits lower standard deviations in dynamic spatiotemporal occupancy and speed compared to real-world data. Finally, the algorithm’s superiority in real-time decision-making and stability is confirmed.
- 26 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 12512-12525
Multi-Vehicle Collaborative Trajectory Planning Based on Kaldor-Hicks Improvement
This paper employs lateral and longitudinal trajectory planning to generate candidate trajectories and discards those that do not satisfy the constraints imposed by single-vehicle conditions. Next, a collaborative trajectory combination set for multiple vehicles is derived from the candidate trajectories, with multi-vehicle constraints applied to eliminate combinations that fail to meet the required conditions. The objective function for each candidate trajectory set is first calculated using a single-vehicle objective function, after which a multi-vehicle objective function based on the Kaldor-Hicks improvement principle is constructed. Finally, the paper introduces an improved particle swarm optimization method for multi-vehicle collaborative trajectory planning. The results demonstrate that the dynamic spatiotemporal occupancy growth rate, under varying planning times and frequencies, is at least 19%. Furthermore, the proposed algorithm ensures efficient allocation of travel resources, preventing competition among vehicles that could compromise system feasibility. When verified with HighD trajectory data, the algorithm not only delivers superior optimization results but also exhibits lower standard deviations in dynamic spatiotemporal occupancy and speed compared to real-world data. Finally, the algorithm’s superiority in real-time decision-making and stability is confirmed.
- 19 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (9) , 11961-11976
Hybrid Trajectory Planning for Connected and Autonomous Vehicle Considering Communication Spoofing Attacks
In this study, we introduce a novel hybrid trajectory planning algorithm for autonomous driving, specifically designed to mitigate the risks posed by spoofing attacks on Connected and Autonomous Vehicles (CAVs). The research begins by assessing the safety implications of attacks and developing an adaptive safety model that is grounded in the fundamental assessment of state and decision data. This model incorporates the establishment of a posterior probability distribution for decision data, rooted in the pre-existing prior distribution but adjusted to account for the influence of spoofing attacks. The adjustment is achieved through Bayesian maximum posterior estimation, thereby refining the model to better adapt to potential threats. The adaptive safety model is then optimized dynamically, taking into consideration a set of indices—safety, comfort, and efficiency—that are critical to trajectory planning. In the subsequent phase, we introduce a composite trajectory planning algorithm that integrates a lateral trajectory selection sampling method with a longitudinal trajectory optimization approach. The adaptive safety model is seamlessly integrated into the trajectory planning process, influencing target position selection, the setting of constraints, and the formulation of the optimization objective function. The results demonstrate that the algorithm effectively limits the average standard deviation of lateral displacement to 0.5851 and achieves a significant increase in longitudinal speed growth rate, by up to 7.30%, surpassing the performance of benchmark algorithms. The proposed solution consistently delivers optimal safety and efficiency across various scenarios and under different parameter conditions.
- 19 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (9) , 11961-11976
Hybrid Trajectory Planning for Connected and Autonomous Vehicle Considering Communication Spoofing Attacks
In this study, we introduce a novel hybrid trajectory planning algorithm for autonomous driving, specifically designed to mitigate the risks posed by spoofing attacks on Connected and Autonomous Vehicles (CAVs). The research begins by assessing the safety implications of attacks and developing an adaptive safety model that is grounded in the fundamental assessment of state and decision data. This model incorporates the establishment of a posterior probability distribution for decision data, rooted in the pre-existing prior distribution but adjusted to account for the influence of spoofing attacks. The adjustment is achieved through Bayesian maximum posterior estimation, thereby refining the model to better adapt to potential threats. The adaptive safety model is then optimized dynamically, taking into consideration a set of indices—safety, comfort, and efficiency—that are critical to trajectory planning. In the subsequent phase, we introduce a composite trajectory planning algorithm that integrates a lateral trajectory selection sampling method with a longitudinal trajectory optimization approach. The adaptive safety model is seamlessly integrated into the trajectory planning process, influencing target position selection, the setting of constraints, and the formulation of the optimization objective function. The results demonstrate that the algorithm effectively limits the average standard deviation of lateral displacement to 0.5851 and achieves a significant increase in longitudinal speed growth rate, by up to 7.30%, surpassing the performance of benchmark algorithms. The proposed solution consistently delivers optimal safety and efficiency across various scenarios and under different parameter conditions.
- Open Access
- 14 November 2023
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2023 (1) , 1-18
Exploring Heterogeneity in Car-Following Behaviors Based on Driver Visual Characteristics: Modeling and Calibration
To investigate the heterogeneity of car-following behaviors across different vehicle combinations from the perspective of driver visual characteristics, the NGSIM dataset from I-80 and US-101 highways was selected and distinct car-following segments were extracted for analysis. Firstly, all the effective vehicle trajectories were extracted and categorized into different vehicle types based on their widths, resulting in four combination types of car-following segments. Visual angle and its change rate were introduced as variables representing driver visual characteristics. Additionally, one-way analysis of variance (ANOVA) was used to compare these variables with traditional ones. The driver’s visual characteristic variables were then incorporated to improve the full velocity difference (FVD) model. Genetic algorithms were employed to calibrate the model under different car-following types, revealing pronounced behavioral variations. After implementing the enhanced drivers’ visual angle (DVA) model, substantial reductions in calibration and validation errors were observed, with calibration errors decreasing by 51.93% and 42.22% and validation errors decreasing by 56.61% and 45.26%. This indicates the DVA model’s remarkable adaptability and stability. Lastly, through a sensitivity analysis of errors, the DVA model demonstrated greater robustness toward the improved error evaluation function. By integrating drivers’ visual characteristics, this study provides in-depth insights into heterogeneous car-following behaviors, enhancing our understanding of driver behaviors and micro-traffic simulation systems.
- 14 November 2023
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2023 (1) , 1-18
Open AccessExploring Heterogeneity in Car-Following Behaviors Based on Driver Visual Characteristics: Modeling and Calibration
To investigate the heterogeneity of car-following behaviors across different vehicle combinations from the perspective of driver visual characteristics, the NGSIM dataset from I-80 and US-101 highways was selected and distinct car-following segments were extracted for analysis. Firstly, all the effective vehicle trajectories were extracted and categorized into different vehicle types based on their widths, resulting in four combination types of car-following segments. Visual angle and its change rate were introduced as variables representing driver visual characteristics. Additionally, one-way analysis of variance (ANOVA) was used to compare these variables with traditional ones. The driver’s visual characteristic variables were then incorporated to improve the full velocity difference (FVD) model. Genetic algorithms were employed to calibrate the model under different car-following types, revealing pronounced behavioral variations. After implementing the enhanced drivers’ visual angle (DVA) model, substantial reductions in calibration and validation errors were observed, with calibration errors decreasing by 51.93% and 42.22% and validation errors decreasing by 56.61% and 45.26%. This indicates the DVA model’s remarkable adaptability and stability. Lastly, through a sensitivity analysis of errors, the DVA model demonstrated greater robustness toward the improved error evaluation function. By integrating drivers’ visual characteristics, this study provides in-depth insights into heterogeneous car-following behaviors, enhancing our understanding of driver behaviors and micro-traffic simulation systems.
- Open Access
- 31 March 2022
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2022, 1-15
Analysis of Key Commuting Routes Based on Spatiotemporal Trip Chain
Commuting pattern is one of the most important travel patterns on the road network; the analysis of commuting pattern can provide support for public transport system optimization, policy formulation, and urban planning. In this study, a framework of the key commuting route mining algorithm based on license plate recognition (LPR) data is proposed. And the proposed algorithm framework can be migrated to any similar spatiotemporal data, such as GPS trajectory data. Commuting pattern vehicles are first extracted, and then, the spatiotemporal trip chains of all commuting pattern vehicles are mined. Based on the spatiotemporal trip chains, the spatiotemporal similarity matrix is constructed by dynamic time warping (DTW) algorithm. Finally, the characteristics of commuting pattern are analysed by the density-based spatial clustering of applications with noise (DBSCAN) algorithm. Different from other researches that analyse the commuting pattern using machine learning algorithms based on all data, this study first extracts commuting pattern vehicles and then designs a key commuting route mining algorithm framework for commuting pattern vehicles. Taking Hangzhou as an example, through the framework of mining algorithm proposed in this study, the commuting pattern characteristics and key commuting routes in Hangzhou have been successfully excavated, and policy suggestions based on the analysis results have also been put forward.
- 31 March 2022
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2022, 1-15
Open AccessAnalysis of Key Commuting Routes Based on Spatiotemporal Trip Chain
Commuting pattern is one of the most important travel patterns on the road network; the analysis of commuting pattern can provide support for public transport system optimization, policy formulation, and urban planning. In this study, a framework of the key commuting route mining algorithm based on license plate recognition (LPR) data is proposed. And the proposed algorithm framework can be migrated to any similar spatiotemporal data, such as GPS trajectory data. Commuting pattern vehicles are first extracted, and then, the spatiotemporal trip chains of all commuting pattern vehicles are mined. Based on the spatiotemporal trip chains, the spatiotemporal similarity matrix is constructed by dynamic time warping (DTW) algorithm. Finally, the characteristics of commuting pattern are analysed by the density-based spatial clustering of applications with noise (DBSCAN) algorithm. Different from other researches that analyse the commuting pattern using machine learning algorithms based on all data, this study first extracts commuting pattern vehicles and then designs a key commuting route mining algorithm framework for commuting pattern vehicles. Taking Hangzhou as an example, through the framework of mining algorithm proposed in this study, the commuting pattern characteristics and key commuting routes in Hangzhou have been successfully excavated, and policy suggestions based on the analysis results have also been put forward.