| Efficiently controlling the flow of traffic across complex transportation networks remains an intricate challenge. In recent work, the problem of scheduling traffic at an intersection has been addressed by structuring the problem as a Markov decision process (MDP). It has been shown that by using dynamic programming techniques, which aim to solve the Bellman equation given a stochastic model of the system, an optimal control strategy can be obtained. However, in real life, an accurate model of the system is not provided. Approximating a model yields limited results due to the inherent non-stationarity and non-Markovian properties of vehicular traffic flows. It is, therefore, important to develop techniques which not only improve the performance of the signaling system but also remain computationally modest. |