Related papers: Relaxation models for scalar traffic networks and …

The phenomenological textbook equations for the charge and heat transport are extensively used in a number of fields ranging from semiconductor devices to thermoelectricity. We provide a rigorous derivation of transport equations by solving…

In this paper, we propose a control design methodology for a linearized continuum traffic model in the congested regime. The continuum traffic flow on a highway is modeled using a linearized quasilinear hyperbolic partial differential…

We introduce and discuss two nonlinear perturbed extensions of the Cucker-Smale model with asymmetric coupling weights. The first model assumes a finite collection of autonomous agents aiming to perform a consensus process in the presence…

This paper addresses the problem of a boundary control design for traffic evolving in a large-scale urban network. The traffic state is described on a macroscopic scale and corresponds to the vehicle density, whose dynamics are governed by…

We consider in this paper a velocity discretized version of the full linear kinetic BGK model and the corresponding limit for small Knudsen number, the linearised Euler or acoustic system. Considering these equations on networks, coupling…

Network equilibrium models represent a versatile tool for the analysis of interconnected objects and their relationships. They have been widely employed in both science and engineering to study the behavior of complex systems under various…

This paper investigates the zero relaxation limit for general linear hyperbolic relaxation systems and establishes the asymptotic convergence of slow variables under the unimprovable weakest stability condition, akin to the Lax equivalence…

Connected and automated vehicles (CAVs) provide the most intriguing opportunity to improve energy efficiency, traffic flow, and safety. In earlier work, we addressed the constrained optimal coordination problem of CAVs at different traffic…

Platooning of connected and autonomous vehicles (CAVs) has a significant potential for throughput improvement. However, the interaction between CAVs and non-CAVs may limit the practically attainable improvement due to platooning. To better…

Networks where each node has one or more associated numerical values are common in applications. This work studies how summary statistics used for the analysis of spatial data can be applied to non-spatial networks for the purposes of…

Lagrangian Relaxation (LR) is a powerful technique for solving large-scale Mixed Integer Linear Programming (MILP), particularly those with decomposable structures, such as vehicle routing or unit commitment problems. By relaxing the…

We examine a reduced membrane model of liquid crystal polymer networks (LCNs) via asymptotics and computation. This model requires solving a minimization problem for a non-convex stretching energy. We show a formal asymptotic derivation of…

We derive traffic rule for spectral networks for A_2 theory for Riemann surface with punctures and use it to study in details the moduli space M of flat GL(3,C) connections on P^1 with 3 full punctures. We apply the simplified traffic rule…

Congestion in transport networks is a topic of theoretical interest and practical importance. In this paper we study the flow of vehicles in urban street networks. In particular, we use a cellular automata model to simulate the motion of…

We use the asymmetric simple exclusion process for describing vehicular traffic flow at the intersection of two streets. No traffic lights control the traffic flow. The approaching cars to the intersection point yield to each other to avoid…

We study a queueing network with a strictly upper-triangular routing matrix, where each column contains at most one non-negative entry, and the root node receives input from a spectrally positive L\'{e}vy process. Our aim is to characterize…

I propose an approximation scheme for asymptotically free field theories combining both weak coupling and strong coupling series. The weak coupling expansion is used to integrate the high frequency modes and the resulting low energy…

In asymptotic regimes, both in time and space (network size), the derivation of network capacity results is grossly simplified by brushing aside queueing behavior in non-Jackson networks. This simplifying double-limit model, however, lends…

We consider a conservation law model of traffic flow, where the velocity of each car depends on a weighted average of the traffic density $\rho$ ahead. The averaging kernel is of exponential type: $w_\varepsilon(s)=\varepsilon ^{-1}…

This paper proposes a new algorithm for simultaneous graph matching and clustering. For the first time in the literature, these two problems are solved jointly and synergetically without relying on any training data, which brings advantages…