Related papers: Networks of fixed-cycle intersections
Traffic-light modelling is a complex task, because many factors have to be taken into account. In particular, capturing all traffic flows in one model can significantly complicate the model. Therefore, several realistic features are…
A network of signalized intersections is modeled as a queuing network. The intersections are regulated by fixed-time (FT) controls, all with the same cycle length or period, $T$. Vehicles arrive from outside the network at entry links in a…
A macroscopic model is proposed to depict the traffic dynamics involved in urban traffic systems. The link dynamics are described based on the cell-transmission model and bounded by the link capacities, while the flow dynamics are proposed…
The fixed-cycle traffic-light (FCTL) queue is the standard model for intersections with static signaling, where vehicles arrive, form a queue and depart during cycles controlled by a traffic light. Classical analysis of the FCTL queue based…
We propose a stochastic model for the intersection of two urban streets. The vehicular traffic at the intersection is controlled by a set of traffic lights which can be operated subject to fix-time as well as traffic adaptive schemes.…
Setting traffic light signals is a classical topic in traffic engineering, and important in heavy-traffic conditions when green times become scarce and longer queues are inevitably formed. For the fixed-cycle traffic-light queue, an…
Optimal traffic-light settings are generally hard to obtain, certainly for actuated access control of an intersection. Typically, computationally expensive (microscopic) simulations or complicated optimization schemes are required to find…
We study the impact of global traffic light control strategies in a recently proposed cellular automaton model for vehicular traffic in city networks. The model combines basic ideas of the Biham-Middleton-Levine model for city traffic and…
A model for traffic flow in street networks or material flows in supply networks is presented, that takes into account the conservation of cars or materials and other significant features of traffic flows such as jam formation, spillovers,…
Based on fluid-dynamic and many-particle (car-following) simulations of traffic flows in (urban) networks, we study the problem of coordinating incompatible traffic flows at intersections. Inspired by the observation of self-organized…
This works explores and illustrates recent results developed by the author in field of dynamical network analysis. The considered approach is blind, i.e., no a priori assumptions on the interconnected systems are available. Moreover, the…
We present a fluid-dynamic model for the simulation of urban traffic networks with road sections of different lengths and capacities. The model allows one to efficiently simulate the transitions between free and congested traffic, taking…
We propose a two dimensional probabilistic cellular automata for the description of traffic flow in a small city network composed of two intersections. The traffic in the network is controlled by a set of traffic lights which can be…
Detecting emergency vehicles arrival on roads has been the focus for many researchers. It is quite important to detect the emergency vehicles (e.g; ambulance) arrival to traffic light to give the green light for it to pass through. Many…
Simple physical models based on fluid mechanics have long been used to understand the flow of vehicular traffic on freeways; analytically tractable models of flow on an urban grid, however, have not been as extensively explored. In an ideal…
We propose here an autonomous traffic signal control model based on analogy with neural networks. In this model, the length of cycle time period of traffic lights at each signal is autonomously adapted. We find a self-organizing collective…
Summary: Traffic light coordination is a complex problem. In this paper, we extend previous work on an abstract model of city traffic to allow for multiple street intersections. We test a self-organizing method in our model, showing that it…
This paper proposes a simplified version of classical models for urban transportation networks, and studies the problem of controlling intersections with the goal of optimizing network-wide congestion. Differently from traditional…
We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…
We consider traffic flow dynamics for a network of signalized intersections, where the outflow from every link is constrained to be equal to a given capacity function if the queue length is positive, and equal to the minimum of cumulative…