Stability analysis of transportation networks with multiscale driver decisions

Abstract

Stability of Wardrop equilibria is analyzed for dynamical transportation networks in which the drivers' route choices are influenced by information at multiple temporal and spatial scales. The considered model involves a continuum of indistinguishable drivers commuting between a common origin/destination pair in an acyclic transportation network. The drivers' route choices are affected by their, relatively infrequent, perturbed best responses to global information about the current network congestion levels, as well as their instantaneous local observation of the immediate surroundings as they transit through the network. A novel model is proposed for the drivers' route choice behavior, exhibiting local consistency with their preference toward globally less congested paths as well as myopic decisions in favor of locally less congested paths. The simultaneous evolution of the traffic congestion on the network and of the aggregate path preference is modeled by a system of coupled ordinary differential equations. The main result shows that, if the frequency of updates of path preferences is sufficiently small as compared to the frequency of the traffic flow dynamics, then the state of the transportation network ultimately approaches a neighborhood of the Wardrop equilibrium. The presented results may be read as a further evidence in support of Wardrop's postulate of equilibrium, showing robustness of it with respect to non-persistent perturbations. The proposed analysis combines techniques from singular perturbation theory, evolutionary game theory, and cooperative dynamical systems.

On imitation dynamics in potential population games

“…Combining the above with (27), we get thatΦ(x) ≥ 0 (thus proving (26)). Finally,Φ(x) = 0 if and only if all the terms…”

On resilient control of dynamical flow networks

“…It is worth emphasizing that the treatment in this paper has been focused on single-commodity firstorder models of dynamical flow networks and specifically on their stability and robustness properties. Other aspects of dynamical flow networks of current interest that have not been discussed here include: optimal dynamical flow network control (see, e.g., [37] for convex formulations with demand and supply constraints generalizing ideas in [44,45]); multi-scale models coupling dynamical flow networks with game-theoretic learning dynamics [46] modeling the selfish route choice behaviors of the drivers; extensions of the margin of resilience framework to multi-commodity dynamical flow networks for which only preliminary results are currently available [47].…”

A mean field approach to model flows of agents with path preferences over a network

“…• A MF equilibrium is a total mass ρ ∈ X that satisfies ρ ∈ ψ(ρ). Note that ρ ∈ ψ(ρ) implies that ρ induces a set of optimal controls as in (15), (17), (19), (21) used both to compute the corresponding path preference vector z and to define the fractions of flows according to a split function µ. Such a function is given as in Definition 2 but with the difference that µ is not linked to any ε-partition, and its components are not necessarily piecewise constant.…”