Data parallelism in traffic control tables with arrival information

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Traffic lights can be controlled dynamically through rules reacting on the number of waiting vehicles at each light. A rule can be captured by a so-called Traffic Control Table (TCT). The Value Iteration method from Stochastic Dynamic Programming has been used for simple networks to derive a TCT. This work studies the generation of a TCTbased rule that takes the arrival information of new vehicles into account. The question is how to generate such a table for simple intersections (or a network of these). The generation is particularly difficult due to the computational work involved in the Value Iteration process. The problem is formulated as a Markov Decision Process and the parallelization of the Value Iteration method for this problem is discussed. We are specifically interested in exploiting the structure of the problem for simple infrastructures, with only a few traffic lanes, using a parallel algorithm.

Cite

CITATION STYLE

APA

Herrera, J. F. R., Hendrix, E. M. T., Casado, L. G., & Haijema, R. (2014). Data parallelism in traffic control tables with arrival information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8805, pp. 60–70). Springer Verlag. https://doi.org/10.1007/978-3-319-14325-5_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free