GPS Navigation and Data Structures By Michael Cabassol and Augie Hill.

Slides:



Advertisements
Similar presentations
Bellman-Ford algorithm
Advertisements

Problem solving with graph search
Single Source Shortest Paths
Chapter 9: Graphs Shortest Paths
All of the planets in our solar system revolve around our sun. Today you will investigate the speeds at which they move around. Orbiting Our Sun.
The Greedy Approach Chapter 8. The Greedy Approach It’s a design technique for solving optimization problems Based on finding optimal local solutions.
Design and Analysis of Algorithms Single-source shortest paths, all-pairs shortest paths Haidong Xue Summer 2012, at GSU.
Michael Ghoorchian. Edsger W. Dijkstra ( ) Dutch Computer Scientist Received Turing Award for contribution to developing programming languages.
1 Greedy 2 Jose Rolim University of Geneva. Algorithmique Greedy 2Jose Rolim2 Examples Greedy  Minimum Spanning Trees  Shortest Paths Dijkstra.
Chapter 7: Greedy Algorithms 7.4 Finding the Shortest Path Dijkstra’s Algorithm pp
CSC 213 Lecture 23: Shortest Path Algorithms. Weighted Graphs Each edge in weighted graph has numerical weight Weights can be distances, building costs,
1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t
1 Dijkstra's Shortest Path Algorithm Find shortest path from s to t. s 3 t
Shortest Path Problems Directed weighted graph. Path length is sum of weights of edges on path. The vertex at which the path begins is the source vertex.
Tracking Moving Objects in Anonymized Trajectories Nikolay Vyahhi 1, Spiridon Bakiras 2, Panos Kalnis 3, and Gabriel Ghinita 3 1 St. Petersburg State University.
Route Planning Vehicle navigation systems, Dijkstra’s algorithm, bidirectional search, transit-node routing.
Algorithms behind Global Positioning Murray Grace Josh Collins.
Dijkstra’s Algorithm and Heuristic Graph Search David Johnson.
Shortest Path Algorithms. Kruskal’s Algorithm We construct a set of edges A satisfying the following invariant:  A is a subset of some MST We start with.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
Dijkstras Algorithm Named after its discoverer, Dutch computer scientist Edsger Dijkstra, is an algorithm that solves the single-source shortest path problem.
Introduction to GPS Navigation. Introduction The Global Positioning System (GPS) is a free system available 24 hours a day, 365 days. Its an all weather.
Technology Overview Global Positioning System. Global Positioning System:  developed by the US Dept. of Defense  satellite-based  designed to provide.
CSC 213 – Large Scale Programming. Today’s Goals  Discuss what is meant by weighted graphs  Where weights placed within Graph  How to use Graph ’s.
Algorithm Course Dr. Aref Rashad February Algorithms Course..... Dr. Aref Rashad Part: 6 Shortest Path Algorithms.
GPS & You I GPS Basics. Global Positioning System:  developed by the US Dept. of Defense  satellite-based  designed to provide positioning and timing.
Shortest Paths and Dijkstra’s Algorithm CS 105. SSSP Slide 2 Single-source shortest paths Given a weighted graph G and a source vertex v in G, determine.
Shortest Path Graph Theory Basics Anil Kishore.
Dijkstra’s Algorithm: single source shortest paths David Kauchak cs62 Spring 2010.
Shortest Path Algorithms. Definitions Variants  Single-source shortest-paths problem: Given a graph, finding a shortest path from a given source.
Global Positioning Systems GPS Units: Development to Modern Uses.
1 Dijkstra’s Algorithm Dr. Ying Lu RAIK 283 Data Structures & Algorithms.
CSC 213 – Large Scale Programming. Today’s Goals  Discuss what is meant by weighted graphs  Where weights placed within Graph  How to use Graph ’s.
1 Prim’s algorithm. 2 Minimum Spanning Tree Given a weighted undirected graph G, find a tree T that spans all the vertices of G and minimizes the sum.
More than 2 dozen GPS satellites circle the earth twice a day in a very precise orbit and transmit signal information to earth. GPS receivers take this.
Honors Track: Competitive Programming & Problem Solving Finding your way with A*-algorithm Patrick Shaw.
Po-Lung Chen (Dont block me) d091: Urban Transport System 2010/03/26 (1) d091: Urban Transport System Po-Lung Chen Team Dont Block Me, National Taiwan.
An introduction to GPS technology. Thank you to the University of New Hampshire Cooperative Extension Program for providing these materials!
Graphs 1 Neil Ghani University of Strathclyde. Where are we …. We studied lists: * Searching and sorting a list Then we studied trees: * Efficient search.
Shortest Paths.
Lecture 13 Shortest Path.
Single-Source Shortest Paths
Chapter 7: Greedy Algorithms
Shortest Path Problems
Shortest Path Problems
Network Routing.
OVERVIEW 1-st Midterm: 3 problems 2-nd Midterm 3 problems
Minimum-Cost Spanning Tree
Dijkstra’s Algorithm We are given a directed weighted graph
Greedy Algorithms / Dijkstra’s Algorithm Yin Tat Lee
Shortest Path Consider the following weighted undirected graph: 20 10
Minimum-Cost Spanning Tree
Minimum-Cost Spanning Tree
Dijkstra’s Shortest Path Algorithm Neil Tang 03/25/2008
Shortest Path Problems
Shortest Path Algorithms
Single-source shortest paths
Starter Questions Convert the following to minutes :-
Algorithms Lecture # 29 Dr. Sohail Aslam.
Shortest Path Problems
Dijkstra’s Shortest Path Algorithm Neil Tang 3/2/2010
CSE 373 Data Structures and Algorithms
Shortest Path Problems
Graph Algorithms: Shortest Path
CSE 417: Algorithms and Computational Complexity
Implementation of Dijkstra’s Algorithm
Lecture 12 Shortest Path.
Chapter 9: Graphs Shortest Paths
Minimum-Cost Spanning Tree
Data Structures and Algorithm Analysis Lecture 8
Presentation transcript:

GPS Navigation and Data Structures By Michael Cabassol and Augie Hill

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

Visual Example Photos from

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

Data Structure Used Dijkstra’s 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(n^2) Using Priority Heap O(m + nLog(n))

GPS Navigation Fastest Travel Time –Use Dijkstra’s algorithm –Graph weighted by average speed of road Shortest Distance –Use Dijkstra’s algorithm –Graph weighted by road distance. Webpage