### Abstract

When doing collision analysis, it is important to compare close approaches between all active satellites in space with all tracked objects in space. 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 collision possibilities do not need to be analyzed using a high-order propagator, a low-order propagator that is easily parallelizable incorporates a genetic algorithm to find closest approach. The result is a parallel algorithm that filters out low probability collision pairs thus reducing the computation time necessary to evaluate the overall close-approach risk for all of the object pairs.

Original language | English (US) |
---|---|

Pages (from-to) | 251-267 |

Number of pages | 17 |

Journal | Advances in the Astronautical Sciences |

Volume | 112 I |

State | Published - Dec 1 2002 |

Event | Spaceflight Mechanics 2002 - San Antonio, TX, United States Duration: Jan 27 2002 → Jan 30 2002 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Aerospace Engineering
- Space and Planetary Science

### Cite this

*Advances in the Astronautical Sciences*,

*112 I*, 251-267.

}

*Advances in the Astronautical Sciences*, vol. 112 I, pp. 251-267.

**Satellite collision analysis using genetic algorithms as a filter.** / Faulds, Anthony L.; Spencer, David Bradley.

Research output: Contribution to journal › Conference article

TY - JOUR

T1 - Satellite collision analysis using genetic algorithms as a filter

AU - Faulds, Anthony L.

AU - Spencer, David Bradley

PY - 2002/12/1

Y1 - 2002/12/1

N2 - When doing collision analysis, it is important to compare close approaches between all active satellites in space with all tracked objects in space. 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 collision possibilities do not need to be analyzed using a high-order propagator, a low-order propagator that is easily parallelizable incorporates a genetic algorithm to find closest approach. The result is a parallel algorithm that filters out low probability collision pairs thus reducing the computation time necessary to evaluate the overall close-approach risk for all of the object pairs.

AB - When doing collision analysis, it is important to compare close approaches between all active satellites in space with all tracked objects in space. 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 collision possibilities do not need to be analyzed using a high-order propagator, a low-order propagator that is easily parallelizable incorporates a genetic algorithm to find closest approach. The result is a parallel algorithm that filters out low probability collision pairs thus reducing the computation time necessary to evaluate the overall close-approach risk for all of the object pairs.

UR - http://www.scopus.com/inward/record.url?scp=0036919002&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036919002&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0036919002

VL - 112 I

SP - 251

EP - 267

JO - Advances in the Astronautical Sciences

JF - Advances in the Astronautical Sciences

SN - 1081-6003

ER -