When doing collision analysis between two objects in orbit, it is important to compare close approaches between all active orbiting satellites with all tracked objects. All possible combination of object pairs must be analyzed. An algorithm for finding object pairs that have a low chance of collision has been developed. To allow for quick computation so that all close approach possibilities do not need to be analyzed using a high-order propagator, an algorithm with a low-order propagator, incorporating parallel processing techniques and a genetic algorithm to find closest approach, is developed. The resulting algorithm is applied to a sample satellite catalog, and the simulation showed a significant decrease in execution time, as well as rapid convergence on minimum distances between two objects.
All Science Journal Classification (ASJC) codes
- Aerospace Engineering
- Space and Planetary Science