Related papers: Are System Optimal Dynamic Flows Implementable by …
We consider a dynamic model of traffic that has received a lot of attention in the past few years. Users control infinitesimal flow particles aiming to travel from an origin to a destination as quickly as possible. Flow patterns vary over…
Many networked applications, e.g., in the domain of cyber-physical systems, require strict service guarantees, usually in the form of jitter and latency bounds, for time-triggered traffic flows. It is a notoriously hard problem to compute a…
Let $G = (VG, AG)$ be a directed graph with a set $S \subseteq VG$ of terminals and nonnegative integer arc capacities $c$. A feasible multiflow is a nonnegative real function $F(P)$ of "flows" on paths $P$ connecting distinct terminals…
We propose a macroscopic traffic network flow model suitable for analysis as a dynamical system, and we qualitatively analyze equilibrium flows as well as convergence. Flows at a junction are determined by downstream supply of capacity as…
Given the efficiency and equity concerns of a cordon toll, this paper proposes a few alternative distance-dependent area-based pricing models for a large-scale dynamic traffic network. We use the Network Fundamental Diagram (NFD) to monitor…
Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operational network contexts. Such…
This paper studies the problem of optimal flow control in dynamic inventory systems. A dynamic optimal distribution problem, including time-varying supply and demand, capacity constraints on the transportation lines, and convex flow cost…
The problem of optimization of the rolling dynamics model is considered. That providing safe movement at high frequency when interacting with the railway. Moreover, allowing to evaluate the dynamic parameters when designing new and…
Uniform flow distribution across parallel channels directly impacts the performance and efficiency of many fluid and energy systems. However, designing efficient flow manifolds that ensure uniform flow distribution remains a challenge. This…
This paper investigates the control of flow networks, where the control objective is to regulate the measured output (e.g storage levels) towards a desired value. We present a distributed controller that dynamically adjusts the inputs and…
Incorporating pre-collected offline data can substantially improve the sample efficiency of reinforcement learning (RL), but its benefits can break down when the transition dynamics in the offline dataset differ from those encountered…
Flows over time generalize classical network flows by introducing a notion of time. Each arc is equipped with a transit time that specifies how long flow takes to traverse it, while flow rates may vary over time within the given edge…
We derive conditions for monotonicity properties that characterize general flows of a commodity over a network, where the flow is described by potential and flow dynamics on the edges, as well as potential continuity and Kirchhoff-Neumann…
The increasing complexity of urban transportation systems, driven by connected and automated vehicles, calls for new modeling paradigms and scalable control strategies. We propose a non-monetary control framework that leverages autonomous…
Optimality principles in nonequilibrium transport networks are linked to a thermodynamic formalism based on generalized transport potentials endowed with Legendre duality and related contact structure. This allows quantifying the distance…
We study dynamical transportation networks in a framework that includes extensions of the classical Cell Transmission Model to arbitrary network topologies. The dynamics are modeled as systems of ordinary differential equations describing…
The advent of digital twins (DT) for the control and management of communication networks requires accurate and fast methods to estimate key performance indicators (KPI) needed for autonomous decision-making. Among several alternatives,…
This paper introduces a novel theoretical framework and a suite of highly efficient, parallelizable algorithms for solving the large-scale multicommodity flow (MCF) feasibility problem. We reframe the classical constraint-satisfaction…
In this paper we study flow problems on temporal networks, where edge capacities and travel times change over time. We consider a network with $n$ nodes and $m$ edges where the capacity and length of each edge is a piecewise constant…
Resilience has become a key aspect in the design of contemporary infrastructure networks. This comes as a result of ever-increasing loads, limited physical capacity, and fast-growing levels of interconnectedness and complexity due to the…