Biblio

We consider global stability of a flow network model for vehicular traffic. Standard approaches which rely on monotonicity of flow networks for stability analysis do not immediately apply to traffic networks with diverging junctions. In this paper, we show that the network model nonetheless exhibits a mixed monotonicity property. Mixed monotonicity allows us to prove global asymptotic stability by embedding the system in a larger system that is monotone.

We propose a framework for generating a signal control policy for a traffic network of signalized intersections to accomplish control objectives expressible using linear temporal logic. By applying techniques from model checking and formal methods, we obtain a correct-by-construction controller that is guaranteed to satisfy complex specifications. To apply these tools, we identify and exploit structural properties particular to traffic networks that allow for efficient computation of a finite-state abstraction. In particular, traffic networks exhibit a componentwise monotonicity property which enables reaching set computations that scale linearly with the dimension of the continuous state space.}, %keywords={Indexes;Roads;Throughput;Trajectory;Vehicle dynamics;Vehicles;Finite state abstraction;linear temporal logic;transportation networks

Abstract We present an efficient computational procedure for finite abstraction of discrete-time mixed monotone systems by considering a rectangular partition of the state space. Mixed monotone systems are decomposable into increasing and decreasing components, and significantly generalize the well known class of monotone systems. We tightly overapproximate the one-step reachable set from a box of initial conditions by computing a decomposition function at only two points, regardless of the dimension of the state space. We first consider systems with a finite set of operating modes and then extend the formulation to systems with continuous control inputs. We apply our results to verify the dynamical behavior of a model for insect population dynamics and to synthesize a signaling strategy for a traffic network.

Abstract We study the problem of selecting offsets of the traffic signals in a network of signalized intersections to reduce queues of vehicles at all intersections. The signals in the network have a common cycle time and a fixed timing plan. It is assumed that the exogenous demands are constant or periodic with the same period as the cycle time and the intersections are under-saturated. The resulting queuing processes are periodic. These periodic processes are approximated by sinusoids. The sinusoidal approximation leads to an analytical expression of the queue lengths at every intersection as a function of the demands and the vector of offsets. The optimum offset vector is the solution of a quadratically constrained quadratic program (QCQP), which is solved via its convex semidefinite relaxation. Unlike existing techniques, our approach accommodates networks with arbitrary topology and scales well with network size. We illustrate the result in two case studies. The first is an academic example previously proposed in the literature, and the second case study consists of an arterial corridor network in Arcadia, California.

Today's increasingly populous cities require intelligent transportation systems that make efficient use of existing transportation infrastructure. However, inefficient traffic management is pervasive, costing US\$160 billion in the United States in 2015, including 6.9 billion hours of additional travel time and 3.1 billion gallons of wasted fuel. To mitigate these costs, the next generation of transportation systems will include connected vehicles, connected infrastructure, and increased automation. In addition, these advances must coexist with legacy technology into the foreseeable future. This complexity makes the goal of improved mobility and safety even more daunting.

We study the control of monotone systems when the objective is to maintain trajectories in a directed set (that is, either upper or lower set) within a signal space. We define the notion of a directed alternating simulation relation and show how it can be used to tackle common bottlenecks in abstraction-based controller synthesis. First, we develop sparse abstractions to speed up the controller synthesis procedure by reducing the number of transitions. Next, we enable a compositional synthesis approach by employing directed assume-guarantee contracts between systems. In a vehicle traffic network example, we synthesize an intersection signal controller while dramatically reducing runtime and memory requirements compared to previous approaches.