1 / 10

By: Christophe Dufour Chrishon Adams Mischael Joseph

Exploring Mars. By: Christophe Dufour Chrishon Adams Mischael Joseph. Mars probe.

alexander-boyd
Download Presentation

By: Christophe Dufour Chrishon Adams Mischael Joseph

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ExploringMars By: Christophe Dufour Chrishon Adams Mischael Joseph

  2. Mars probe • Two Mars Exploration rovers were launched towards Mars on June 1o and July 7, 2003. Each landed on Mars on January 3 and January 24, 2004, respectively. The mission was to search for evidence of water on Mars. Also, their mission was to search for and characterize many rocks and soils that hold clues to past water activity on Mars. • The spacecrafts were sent to targeted sites on opposite sides of Mars. Each site possibly holding evidence of having water in the past. The landing sites were Gusen Crater, a possible former lake, and Meridiani Planum, suggesting Mars had a wet past. The goal of each rover was to drive up to 40 meters (and 44 yards) per day, for a grand total of 1 kilometer (about three-quarters of a mile).

  3. Traveling Salesman • The Traveling Salesman Problem was first formulated a in 1930. It is a mathematical problem used in graph theory that requires one to find the most efficient route (tour) that a salesman can take to visit n cities exactly once and return home. • In general, the objective is to visit n cities once and return home with the minimum amount of travel. This relates to our project in that we must use the Traveling Salesman Problem in order to find the shortest possible route for a rover that will visit seven sites on Mars.

  4. WEIGHTED GRAPH ON MARS A to N = 3500 A to P = 1500 A to I = 2800 A to G = 7500 A to H = 5000 N to I =2000 N to G = 8000 N to H = 4800 N to W = 3200 N to P = 4000 I to G = 6000 I to H = 4000 I to W = 2900 I to P = 3000 Distance = miles G to H = 3000 G to W = 5000 G to P = 6500 H to W = 2800 H to P = 3500 W to P = 1300 W to A = 2200 N I G A H W P

  5. Distance table

  6. Hamilton Circuits • We found the total number of different Hamilton circuits by using the following known property: if N is the number of vertices of a complete graph then the number of Hamilton circuits in the graph is N minus one factorial: • N = 7 (7-1)! = 6! • 6! = 6.5.4.3.2.1 = 720 • Therefore, there are 720 different Hamilton Circuits to find an optimal route for the seven sites on Mars.

  7. Brute force Algorithm • Brute Force is a list of all the possible Hamilton circuits (tours) of the graph. For each Hamilton tour, we calculate its total weight (add the weights of all the edges in the circuit). An optimal tour ( least value) is then chosen, there is always more than one optimal tour. • The reason the Brute Force Algorithm is inefficient is that there are (6! = 6.5.4.3.2.1 = 720) different Hamilton Circuits to solve for an optimal tour.

  8. THREE EFFICIENT ALGORITHMS FOR FINDING The optimal route • The Cheapest Link Algorithm • CL = APW H G N I A = 21,400 miles • 1500 1300 2800 3000 8000 2000 2800 • The Nearest Neighbor Algorithm • N: A P W H G I N A = 20,100 miles 1500 1300 2800 3000 6000 2000 3500 • The Nearest Neighbor Algorithm gives the most efficient route for the MARS probe to travel with a total of 20,100 miles.

  9. Repetitive Nearest Neighbor • Using the Repetitive Nearest Neighbor Algorithm, we found that beginning at site A produces the shortest traveling distance. • A P W H G I N A = 20,100 • P W A I N H G P = 23,600 • W P A I H N G W = 27,400 • N I APWH G N = 21,400 • I N W P A H G I = 27,000 • H W P A I N G H = 21,400 • G H W P A I N G = 21,400

  10. REFERENCES • Terry, E., Class Notes, July 2010. • Wikipedia, Internet, July 2010.

More Related