A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Online Shortest Paths With Confidence Intervals for Routing in a Time Varying Random Network
2018
2018 International Joint Conference on Neural Networks (IJCNN)
The increase in the world's population and rising standards of living is leading to an ever-increasing number of vehicles on the roads, and with it ever-increasing difficulties in traffic management. This traffic management in transport networks can be clearly optimized by using information and communication technologies referred as Intelligent Transport Systems (ITS). This management problem is usually reformulated as finding the shortest path in a time varying random graph. In this article,
doi:10.1109/ijcnn.2018.8489447
dblp:conf/ijcnn/ChretienG18
fatcat:l36ztjkelfanxlu2grop54gr4m