CoChat

Efficient algorithms for collision avoidance at intersections

Open access
Colombo, Alessandro, Del Vecchio, Domitilla · 2012 · Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control

The DOI matches its Crossref record; 23 of the 24 references it cites were found in a registry or an index.

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.

Overview

Integrity signals

Registry

Crossref · 10.1145/2185632.2185656

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 23 references

Research works printed but not linked: 9

  1. Cormen T. H., 2009, MIT Press
  2. Dacorogna B., 2008, Springer
  3. 10.5555/1703775.1703935 · doi:10.5555/1703775.1703935
  4. Hafner M. R., 2011, Proc. of ITS World Congress
  5. Bryson E., 1969, Ginn and Company
  6. Khalil H. K., 2002, Prentice-Hall
  7. Luenberger D. G., 1969, Wiley
  8. Pinedo M. L., 2008, Springer
  9. U.S. Department of Transportation, 2010, ITS Strategic Research Plan, 2014

Cited by

See all 151

Metadata

Authors
Colombo, A., & Del Vecchio, D.
Affiliations
  • Massachusetts Institute of Technology (US)
  • MIT, Cambridge, USA
Venue
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Publisher
ACM
Published
2012-04-17
Pages
145-154
OpenAlex
W2085865324
Cited by
134
References
24
Citations by year
2026: 1 · 2025: 1 · 2024: 6 · 2023: 10 · 2022: 8 · 2021: 10 · 2020: 10 · 2019: 11 · 2018: 17 · 2017: 14 · 2016: 13 · 2015: 16 · 2014: 10 · 2013: 6 · 2012: 1
FWCI
16.92
Type
conference paper
Language
en
Open access
Locations
  • ACM International Conference on Hybrid Systems: Computation and Control (HSCC) (publishedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc-sa)
  • Virtual Community of Pathological Anatomy (University of Castilla La Mancha) (submittedVersion)
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Traffic control and management
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
  • Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
Keywords
collision avoidance, NP-hardness, approximate algorithms, error bounds, supervisor design, hybrid algorithm, vehicle scheduling, multi-vehicle control, vehicle dynamics

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Efficient algorithms for collision avoidance at intersections. https://app.cochat.ai/papers/10.1145/2185632.2185656
The paper
Colombo, A., & Del Vecchio, D. (2012). Efficient algorithms for collision avoidance at intersections. Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control. https://doi.org/10.1145/2185632.2185656

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.