Road Network Representation using Dijkstra’s Shortest Path Algorithm
In this paper the authors present a new approach to road network representation for the purpose of monitoring and controlling traffic. The new approach is based on so-called mainlinks and accessorlinks instead of the usual links and nodes. The accessorlinks express the complexity of the connection to an intersection of the end of a link (mainly the get-in-lane segments). To detect junctions and accessorlinks automatically for urban road networks from a detailed road network database, a simple distance based algorithm is sufficient. However, motorway junctions are larger and more complex. In this case, Dijkstra’s shortest path algorithm is useful to detect accessorlinks automatically. The representation is used in traffic control systems at the Dutch traffic management company Trinit´e Automatisering B.V.
-
Corporate Authors:
1100 17th Street, NW, 12th Floor
Washington, DC United States 20036 -
Authors:
- Wang, Yubin
- Vrancken, J
- Soares, Michel dos Santos
-
Conference:
- 16th ITS World Congress and Exhibition on Intelligent Transport Systems and Services
- Location: Stockholm , Sweden
- Date: 2009-9-21 to 2009-9-25
- Publication Date: 2009
Language
- English
Media Info
- Media Type: CD-ROM
- Features: Figures; Maps; References;
- Pagination: 5p
- Monograph Title: ITS in Daily Life
Subject/Index Terms
- TRT Terms: Network nodes; Shortest path algorithms; Traffic control; Traffic signal control systems; Traffic surveillance
- Uncontrolled Terms: Traffic networks
- Geographic Terms: Netherlands
- Subject Areas: Highways; Operations and Traffic Management; I73: Traffic Control;
Filing Info
- Accession Number: 01150266
- Record Type: Publication
- Files: TRIS
- Created Date: Feb 19 2010 10:56AM