Efficient Algorithms for Collision Avoidance at Intersections
Name
Del Vecchio_Efficient algorithms.pdf
Size
704.3 KB
Format
Adobe PDF
Checksum (MD5)
729a65edf0ce79a746164b8c5d142938
Author(s)
Colombo, Alessandro
Del Vecchio, Domitilla
Date Issued
April 2012
Journal
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control (HSCC '12)
Publisher
Association for Computing Machinery (ACM)
Citation
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.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2185632.2185656
