Search arXivSearch

arXiv · 2607.25717

Roadside units placement for total travel time minimization in I2X-enabled road networks based on a dynamic traffic flow model

Abstract

This work addresses the problem of locating Road Side Units (RSUs) in vehicular networks with the aim of improving overall traffic efficiency. We propose a heuristic approach for determining the placement of RSUs on a road network, while vehicle dynamics are modeled through a microscopic follow-the-leader interaction in which drivers continuously adapt their speed according to the distance from the vehicle ahead. The RSUs share the collected information among themselves to cooperatively estimate the network state, which is then communicated to vehicles, allowing them to compute their fastest paths. We also assume that not all drivers comply with the provided recommendations, meaning that only a fraction of users follow the suggested routes. Since the aim is to improve network performance while minimizing the number of deployed units, the methodology adopts a nested optimization scheme: an outer module explores the optimal number k of RSUs, while an inner module identifies the best placement configuration for each k. To evaluate the effectiveness and the scalability of the proposed method, we tested two networks with different topologies and sizes. The results show a decrease in Total Travel Time (TTT) compared to the baseline scenario (i.e., without RSUs) of up to 36% on the smaller network and up to 20% on the larger one. Stochastic vehicle origin-destination pairs have also been considered.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emiliano Cristiani, Francesca L. Ignoto, Anna Laura Pala, Giuseppe Stecca. 2026-07-28. Roadside units placement for total travel time minimization in I2X-enabled road networks based on a dynamic traffic flow model. https://arxiv.org/abs/2607.25717

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

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS