AStar and Dijkstra Algorithms in Navigation Traffic Routing

1
A-Star and Dijkstra Algorithms in Navigation
Traffic Routing

• Richard Ali

2
Problem

• Current navigation software is
• Slow
• Route not always optimal
• Solution Evaluate A-Star and Dijkstra algorithms
  as an alternative.

3
Map

• Map file containing nodes and edge cost

4
Dijkstra

• Set all node to have a path cost of infinity.
• Visit every node once and update the path cost if
  the current cost is less than the saved.
• Visit next node with lowest saved path cost.

5
No Traffic
6
With Traffic
7
Summary

• Dijkstra
• Optimal Path
• Have to process entire map

8
Acknowledgements

• Michael Lewis
• Su Wang
• Sam Quan