A threat to a satellite is modeled as a sphere of a given radius. The satellite may be required to be outside of the sphere at a given time or never to enter the sphere at all. The threat sphere may be inertially fixed or may move in a keplerian orbit. A method is described of finding the smallest impulsive maneuver that can be made at a given time to avoid the threat. Using the linearized relationship between the satellite state vector at the maneuver time and the state at the intercept time, iterative algorithms are developed that converge on the optimal evasive maneuver. A computer program that implements the algorithms is described. The results of the algorithm are given for several cases. An interception taken from a plausible real-world scenario is used as a basis for investigating how maneuver size varies with the geometry of the interception. Keywords: Maneuvering satellites, Orbits, Flight maneuvers, Space warfare, and Evasion.
Minimum Impulse Orbital Evasive Maneuvers
1985
102 pages
Report
No indication
English
Unmanned Spacecraft , Maneuvering satellites , Algorithms , Computer programs , Geometry , Interception , Iterations , Time , Maneuvers , Scenarios , Spheres , Threats , Evasion
Minimum impulse orbital evasive maneuvers
AIAA | 1989
|Optimal multiple-impulse satellite evasive maneuvers
AIAA | 1994
|Optimal Multiple-Impulse Satellite Evasive Maneuvers
Online Contents | 1994
|