Learn More
Finding optimal phase durations for a controlled intersection is a computationally intensive task requiring O(N 3) operations. In this paper we introduce cost-optimal parallelization of a dynamic programming algorithm that reduces the complexity to O(N 2). Three implementations that span a wide range of parallel hardware are developed. The first is based on(More)
Finding an optimal solution for traffic-signal control duration is a computationally intensive task. It is typically O(T<sup>3</sup>) in time and O(T<sup>2</sup>) in space, where T is the length of the control interval in discrete-time steps. In this paper, we propose a linear time and space algorithm for the traffic-signal control problem. The algorithm(More)
  • 1