Get the latest Science News and Discoveries
New Algorithm Cracks the Asteroid Routing Problem
The Traveling Salesman is a classic problem in mathematics that requires a solution to the most efficient path to take to visit a given number of cities in the least amount of time. But scale this relatively simple concept up to space travel and the calculation becomes much more complex. Instead of visiting a stationary spot on Earth, when calculating the most efficient path to visit asteroids you must account for the fact they are traveling tens of thousands of miles an hour, and their exact position will change based on when a spacecraft leaves. This is known as the Asteroid Routing Problem, and a new paper from a group of Canadian and European researchers lays out a framework that can find the exact solution to any particular combination of asteroids to be visited.
None
Or read this on Universe Today
