GPS Navigation and Data Structures

1
GPS Navigation and Data Structures

• By Michael Cabassol and Augie Hill

2
How GPS Works

• 24 Satellites orbit Earth
• 11,000 Nautical Miles high (12,658.8 miles)
• Each makes an orbit in 11 hours 58 min
• 24 satellites run on 6 orbits
• 4 Satellites are needed to triangulate position

3
Visual Example
Photos from http//www.nasm.si.edu/exhibitions/gps
/work.html
4
GPS Navigation

• Use of computers and GPS to allow for
• Precise mapping.
• Ease of navigation in vehicles.
• Bomb targeting.
• Land Surveying.

5
Data Structure Used

• Dijkstras Algorithm
• Given a connected, weighted graph and a fixed
  vertex, find shortest path to any other vertex.
• Greedy Algorithm
• Time Complexity
• Using Linear search O(n2)
• Using Priority Heap O(m nLog(n))

6
GPS Navigation

• Fastest Travel Time
• Use Dijkstras algorithm
• Graph weighted by average speed of road
• Shortest Distance
• Use Dijkstras algorithm
• Graph weighted by road distance.

Webpage