Open Access Open Access  Restricted Access Subscription Access

A Graph Theoretic Approach to quantify the Conflict of Traffic Streams in a Traffic Intersection

Ankur Bharali

Abstract


A traffic intersection can be modelled by a graph by considering the streams as vertices and assigning an edge based on the mutually non-conflict streams. In this paper we propose a spectral approach to arrange the steams in order of their conflict and hence determine the most conflicted stream in a traffic intersection.


Keywords


Compatibility graph, Eigenvector centrality, Traffic network

Full Text:

PDF

References


Guberinić, S., Senborn, G., Lazic, B., Optimal Traffic Control: Urban Intersections, CRC Press 2008.

West, D. B., Introduction to Graph Theory, Pearson, 2017.

Bonaicich P., Some unique properties of eigenvector centrality, Social Networks 29, 555-564, 2007.

Borgatti Stephen P., Centrality and network flow, Social Networks 27, 55-71, 2005.

Spizzirri L., Justification and application of eigenvector centrality, http://www.math.

washington.edu/morrow/336-11/papers/leo.pdf, March 6, 2011.

Roberts, Fred S., Graph Theory and its Applications to Problems of Society, SIAM, Philadelphia, 1978.

Reidel, T., Brunner, U., Traffic Control using Graph Theory, 12th IFAC World Congress,

Sydney, 1993.


Refbacks

  • There are currently no refbacks.