Search arXivSearch

arXiv · 2608.09144

How Roadside Units Enhance Intersection Safety? Cooperative Autonomous Driving System Design and A Proof of Concept

Abstract

Intersections remain one of the most hazardous locations in urban road networks, where heterogeneous traffic participants and limited visibility frequently lead to severe traffic conflicts. In this paper, a vehicle-to-infrastructure-to-vehicle (V2I2V) cooperative system is proposed for improving road safety and traffic efficiency by using digital twins (DTs) deployed on roadside units (RSUs) to eliminate blind spots and centrally coordinate connected and automated vehicles (CAVs) in smart intersections. The proposed system integrates cloud-based global DTs for macroscopic guidance and RSU-based local DTs for real-time operations. Within this architecture, a hierarchical reinforcement learning (HRL) framework combines offline pre-training with online fine-tuning to achieve robust cooperative control. Experimental results show that the proposed system achieves substantial improvements in safety and efficiency in simulation experiments and real-world proof-of-concept (PoC) trials. In simulations, our system ensures high safety, efficiency, and smoothness under realistic communications and traffic constraints. In PoC trials, the RSU-centric control loop achieves a decision-making latency of approximately 42 ms and maintains a safe stopping distance of 8.5 m for pedestrians, while also shortening stop duration and overall traversal time. These results indicate that the proposed system provides robust and scalable performance at smart intersections.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taoyuan Yu, Kui Wang, Zongdian Li, Tao Yu, Walid Saad, Kei Sakaguchi. 2026-08-10. How Roadside Units Enhance Intersection Safety? Cooperative Autonomous Driving System Design and A Proof of Concept. https://arxiv.org/abs/2608.09144

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY