Satellite Information Research Center, Korea Aerospace Research Institute, Daejeon 305-333, KoreaIn this paper, the authors introduced a new approach to find the optimal collision avoidance maneuver considering multi threatening objects within short period, while satisfying constraints on the fuel limit and the acceptable collision probability. A preliminary effort in applying a genetic algorithm (GA) to those kinds of problems has also been demon-strated through a simulation study with a simple case problem and various fitness functions. And then, GA is applied to the complex case problem including multi-threatening objects. Two distinct collision avoidance maneuvers are dealt with: the first is in-track direction of collision avoidance maneuver. The second considers radial, in-track, cross-track direction maneuver. The results show that the first case violates the collision probability threshold, while the second case does not violate the threshold with satisfaction of all conditions. Various factors for analyzing and planning the optimal collision avoidance maneuver are also presented.
[1]
Christopher F. Chyba,et al.
A Verifiable Limited Test Ban for Anti-satellite Weapons
,
2010
.
[2]
Hyochoong Bang,et al.
Genetic Design of Target Orbits for a Temporary Reconnaissance Mission
,
2009
.
[3]
Afonso C. C. Lemonge,et al.
An Adaptive Penalty Method for Genetic Algorithms in Constrained Optimization Problems
,
2008
.
[4]
Noelia Sanchez-ortiz,et al.
Collision avoidance manoeuvres during spacecraft mission lifetime: Risk reduction and required ΔV
,
2006
.
[5]
Salvatore Cssi Alfano,et al.
Collision Avoidance Maneuver Planning Tool
,
2005
.
[6]
David E. Goldberg,et al.
Genetic Algorithms in Search Optimization and Machine Learning
,
1988
.