Autonomous and Connected Intersection Crossing Traffic Management using Discrete-Time Occupancies Trajectory

no code implementations • 12 May 2017 • Qiang Lu, Kyoung-Dae Kim

Then, we show that the basic DICA has a computational complexity of $\mathcal{O}(n^2 L_m^3)$ where $n$ is the number of vehicles granted to cross an intersection and $L_m$ is the maximum length of intersection crossing routes.

Computational Efficiency Management