Finding the fastest navigation rout by real-time future traffic estimations

Abstract

Computing the fastest rout in traffic is a long researched problem, with several solutions to it. Most of these solutions consider the current status of the road in a given time, including vehicles that are currently in the planned rout. The problem with this approach is that vehicles that are currently placed in a point that will be reached within a certain amount of time, will no longer be there at the arrival time. This creates a problem, that even exists in the most popular navigation application such as Waze and Google Maps, where the ETA is constantly changing during the travel. In this research we suggest a different approach, that finds the fastest traffic rout according to the future positions of vehicles at the designated points in the rout. This approach will give a much more efficient navigation paradigm, in which the estimated travel times are realistic and accurate.