Researchers Solve 10-Asteroid Routes Exactly With Peel-and-Bound, Beating Heuristic Records Up to 30 Targets
Updated
Updated · Universe Today · May 18
Researchers Solve 10-Asteroid Routes Exactly With Peel-and-Bound, Beating Heuristic Records Up to 30 Targets
2 articles · Updated · Universe Today · May 18
Canadian and European researchers developed a "Peel-and-Bound" framework that proved exact optimal routes for missions visiting 10 asteroids, typically in less than two hours.
The method tackles the asteroid routing problem by first building a simplified decision diagram, then running full orbital-transfer calculations only on the most promising paths and pruning weaker ones.
For larger cases covering 15 to 30 asteroids, the framework did not always prove exact optima but still outperformed previous heuristic methods in time and computational efficiency.
The current approach still has limits: it can be misled by local minima and assumes instantaneous impulsive maneuvers, not the low-thrust propulsion systems expected for many future asteroid missions.
The advance could improve planning for future asteroid exploration and resource-use missions, where exact multi-target route optimization has been too computationally expensive.
Could this space navigation algorithm soon optimize your daily commute or package deliveries on Earth?
How will this optimal routing tech change the business case for mining precious metals from asteroids?
With quantum AI advancing, is this classical asteroid routing breakthrough already on the verge of obsolescence?
Peel-and-Bound: Achieving the First Exact Solution to the Asteroid Routing Problem and Its Impact on Space Logistics
Overview
The Asteroid Routing Problem (ARP) challenges space agencies with planning optimal paths to visit multiple moving asteroids, a task made difficult by their constant motion and the high computational cost of trajectory calculations. Traditional methods relied on approximations and could not guarantee the best solution. The introduction of the peel-and-bound methodology changed this by delivering the first exact solution to ARP, ensuring the absolute best route is found. This breakthrough, developed through collaboration after an ESA competition and further refined at Universitat Bielefeld, not only solves ARP exactly but also opens new possibilities for advanced heuristic techniques in space mission planning.