Which algorithm is used by Google Maps?

[vashilove]

Hello friends,

Which algorithm is used by Google Maps?

[dennis123]

Hi Friends,
It is essentially A* with travel times as weights, but with additional constraints, such as predicted wait times for turns. Additionally, it is simplified by trying to use main arteries for longer distances to reduce the search space of the graph. Additionally, there is a great deal of caching of routes, since someone has probably been the way you want to go before. The travel times on these routes can be updated with traffic/travel time data from users and other sources.

[PrimeItSolution]

Google Maps uses A* algorithm for finding the shortest path and alternates routes in real time. A* algorithm is an advanced form of Breadth first search.It avoids costly path and choose the most promising path . It is a very smart algorithm.

[iastitlesearch]

At each iteration of its main loop, A* needs to determine which of its partial paths to expand into one or more longer paths. It does so based on an estimate of the cost (total time taken) still to go to the goal node. Specifically, A* selects the path that minimise.

f(n)=g(n)+h(n)

where n is the destination node on the path, g(n) is the cost of the path from the start node to n, and h(n) is a heuristic that estimates the shortest path from source to the destination. The heuristic is problem-specific. In this case it is time taken to reach somewhere.

[GeethaN]

Google Maps uses A* algorithm for finding the shortest path and alternates routes in real time. A* algorithm is an advanced form of Breadth first search.It avoids costly path and choose the most promising path . It is a very smart algorithm. It is used approximate the shortest path in real-life situations, like- in maps, games where there can be many hindrances. It is formulated in terms of weighted graphs in case of google map this weight is travel time. Starting from a specific node(source node) of a graph, it constructs a tree of paths starting from that node, expanding paths one step at a time, until one of its paths ends at the predetermined destination node.

At each iteration of its main loop, A* needs to determine which of its partial paths to expand into one or more longer paths. It does so based on an estimate of the cost (total time taken) still to go to the goal node. Specifically, A* selects the path that minimise.

f(n)=g(n)+h(n)

where n is the destination node on the path, g(n) is the cost of the path from the start node to n, and h(n) is a heuristic that estimates the shortest path from source to the destination. The heuristic is problem-specific. In this case it is time taken to reach somewhere.

[jayam]

Google Maps uses A* algorithm for finding the shortest path and alternates routes in real time. A* algorithm is an advanced form of Breadth first search.It avoids costly path and choose the most promising path . It is a very smart algorithm.