Boundaries on Range-Range Constrained Admissible Regions for Optical Space Surveillance

John A. Gaebler, Smead Aerospace Engineering Sciences – University of Colorado Boulder, Penina Axelrad, Smead Aerospace Engineering Sciences – University of Colorado Boulder, Paul W. Schumacher, Jr, Air Force Research Laboratory – Space Surveillance Systems Branch

Keywords: Range-Range, Hypothesis Regions, Admissible Regions, SSA, Situational Awareness, IOD, Initial Orbit Determination

Abstract:

We propose a new type of admissible-region analysis for track initiation in multi-satellite problems when apparent angles measured at known stations are the only observable. The goal is to create an efficient and parallelizable algorithm for computing initial candidate orbits for a large number of new targets. It takes at least three angles-only observations to establish an orbit by traditional means. Thus one is faced with a problem that requires N-choose-3 sets of calculations to test every possible combination of the N observations. An alternative approach is to reduce the number of combinations by making hypotheses of the range to a target along the observed line-of-sight. If realistic bounds on the range are imposed, consistent with a given partition of the space of orbital elements, a pair of range possibilities can be evaluated via Lambert’s method to find candidate orbits for that that partition, which then requires Nchoose- 2 times M-choose-2 combinations, where M is the average number of range hypotheses per observation. The contribution of this work is a set of constraints that establish bounds on the range-range hypothesis region for a given element-space partition, thereby minimizing M. Two effective constraints were identified, which together, constrain the hypothesis region in range-range space to nearly that of the true admissible region based on an orbital partition. The first constraint is based on the geometry of the vacant orbital focus. The second constraint is based on time-of-flight and Lagrange’s form of Kepler’s equation. A complete and efficient parallelization of the problem is possible on this approach because the element partitions can be arbitrary and can be handled independently of each other.

Date of Conference: September 19-22, 2017

Track: Astrodynamics

View Paper