In this paper, we address the problem of optimal and safe coordination of autonomous vehicles through a traffic intersection. We state the problem as a finite time, constrained optimal control problem, a combinatorial optimization problem that is difficult to solve in real-time. A low complexity computational scheme is proposed, based on a hierarchical decomposition of the original optimal control formulation, where a central coordination problem is solved together with a number of local optimal control problems for each vehicle. We show how the proposed decomposition allows a reduction of the complexity of the central problem, provided that approximated parametric solutions of the local problems are available beforehand. We derive conditions for the construction of the parametric approximations and demonstrate the method with a numerical example.
展开▼
