Euclidean Approach to Green-Wave Theory Applied to Traffic Signal Networks

TL;DR

This paper introduces a Euclidean-inspired green-wave theory for traffic signal networks, enabling efficient, uninterrupted flow on arterial roads through geometric modeling and simulation validation.

Contribution

It presents a novel Euclidean-based model for coordinating traffic signals on arterial roads, improving flow and efficiency with a new theoretical framework.

Findings

Green-arrow lengths are limited and discrete.

The model can convert existing roads into RGW-roads.

Signal timings derived are effective in simulations.

Abstract

Travel on long arterials with signalized intersections can be inefficient if not coordinated properly. As the number of signals increases, coordination becomes more challenging and traditional progression schemes tend to break down. Long progressions save travel time and fuel, reduce pollution and traffic accidents by providing a smoother flow of traffic. This paper introduces a green-wave theory that can be applied to a network of intersecting arterial roads. It enables uninterrupted flow on arbitrary long signalized arterials using a Road-to-Traveler-Feedback Device. The approach is modelled after Euclid. We define concepts such as RGW-roads (roads where vehicles traveling at the recommended speed make all traffic signals), green-arrows (representing vehicle platoons), real nodes (representing signalized intersections where RGW-roads intersect) and virtual nodes, green-wave speed, blocks, etc. - the analogue of Euclid's postulates. We then use geometric reasoning to deduce results: green-arrow lengths have a maximum value, are restricted to discrete lengths, and green-arrow laws of motion imply that select existing arterial roads can be converted to RGW-roads. The signal timings and offsets that are produced have been shown to be effective using a simulation model developed previously called RGW-SIM.