Efficient Algorithms for Collision Avoidance at Intersections
Author(s)Colombo, Alessandro; Del Vecchio, Domitilla
MetadataShow full item record
We consider the problem of synthesising the least restrictive controller for collision avoidance of multiple vehicles at an intersection. The largest set of states for which there exists a control that avoids collisions is known as the maximal controlled invariant set. Exploiting results from the scheduling literature we prove that, for a general model of vehicle dynamics at an intersection, the problem of checking membership in the maximal controlled invariant set is NP-hard. We then describe an algorithm that solves this problem approximately and with provable error bounds. The approximate solution is used to design a supervisor for collision avoidance whose complexity scales polynomially with the number of vehicles. The supervisor is based on a hybrid algorithm that employs a dynamic model of the vehicles and periodically solves a scheduling problem.
DepartmentMassachusetts Institute of Technology. Department of Mechanical Engineering
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control (HSCC '12)
Association for Computing Machinery (ACM)
Alessandro Colombo and Domitilla Del Vecchio. 2012. Efficient algorithms for collision avoidance at intersections. In Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control (HSCC '12). ACM, New York, NY, USA, 145-154.
Author's final manuscript