A Collision-Aware Predictive Rerouting Framework for Connected and Automated Vehicles

Abstract

In this paper, we investigate the problem of mitigating non-recurrent congestion in urban transportation networks through predictive and adaptive routing for connected and automated vehicles (CAVs). We propose a collision-aware predictive rerouting framework that integrates microscopic SUMO simulation, DCRNN-based spatiotemporal traffic-state forecasting, collision-window lookahead, and multi-objective route scoring. The routing controller uses predicted congestion, live emission information, route-length penalties, and incident-window constraints to decide when CAVs deviate from their current routes. The completed simulation campaign across three urban network scenarios, five CAV penetration levels, three random seeds, and multiple benchmark rerouting strategies shows that the proposed full framework does not dominate all baselines in aggregate travel time, distance, or emissions. Instead, its principal advantage is operational stability: it maintains comparable network-level efficiency while substantially reducing rerouting frequency relative to active rerouting baselines. These results demonstrate both the promise and the tradeoffs of embedding graph-based prediction and collision awareness into real-time CAV rerouting, and they motivate further work on forecast calibration, uncertainty-aware prediction, and system-level fairness between CAV and non-CAV traffic.