Road Network Representation using Dijkstra’s Shortest Path Algorithm.

Auteur(s)
Wang, Y. Vrancken, J. & Soares, M.D.
Jaar
Samenvatting

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.

Publicatie aanvragen

2 + 1 =
Los deze eenvoudige rekenoefening op en voer het resultaat in. Bijvoorbeeld: voor 1+3, voer 4 in.

Publicatie

Bibliotheeknummer
C 47361 (In: C 46669 CD-ROM) /73 /71 / ITRD E854678
Uitgave

In: ITS in daily life : proceedings of the 16th World Congress on Intelligent Transport Systems (ITS), Stockholm, Sweden, September 21-25, 2009, 5 p.

Onze collectie

Deze publicatie behoort tot de overige publicaties die we naast de SWOV-publicaties in onze collectie hebben.