Continuous and Discrete-Time Optimal Controls for an Isolated Signalized Intersection

Abstract EN

A classical control problem for an isolated oversaturated intersection is revisited with a focus on the optimal control policy to minimize total delay.

The difference and connection between existing continuous-time planning models and recently proposed discrete-time planning models are studied.

A gradient descent algorithm is proposed to convert the optimal control plan of the continuous-time model to the plan of the discrete-time model in many cases.

Analytic proof and numerical tests for the algorithm are also presented.

The findings shed light on the links between two kinds of models.