Seminars

Events Calendar

Seminars

Dissertation Defense - Orbital Mechanics - Uncertainty Propagation and Conjunction Assessment for Resident Space Objects

Monday, November 9, 2015
10:00 am

WRW 410

Presently, the catalog of Resident Space Objects (RSOs) in Earth orbit tracked by the U.S. Space Surveillance Network (SSN) is greater than 21,000 objects. The size of the catalog continues to grow due to an increasing number of launches, improved tracking capabilities, and in some cases, collisions. Simply propagating the states of these RSOs is a computational burden, while additionally propagating the uncertainty distributions of the RSOs and computing collision probabilities increases the computational burden by at least an order of magnitude.

The equations of motion in orbital mechanics are highly nonlinear and will therefore, result in non-Gaussian distributions of the uncertainty of the future states of the RSOs. Two ways of reducing the total computation time for non-Gaussian uncertainty propagation are investigated: 1) Reducing the required number of function evaluations and 2) Parallelizing computation over multiple processors.

Tools are developed that propagate the uncertainty of RSOs with Gaussian initial uncertainty from epoch until a close approach. The number of possible elements in the form of a precomputed library, in a Gaussian Mixture Model (GMM) has been increased and the strategy for multivariate problems has been formalized. The accuracy of a GMM is increased by propagating each element by a Polynomial Chaos Expansion (PCE). Both techniques reduce the number of function evaluations required for uncertainty propagation and result in a sliding scale where accuracy can be improved at the cost of increased computation time.  A parallel implementation of the accurate benchmark Monte Carlo (MC) technique has been developed on the Graphics Processing Unit (GPU) that is capable of using samples from any uncertainty propagation technique to compute the collision probability. The GPU MC tool delivers up two orders of magnitude speedups compared to a serial CPU implementation. Finally, a CPU implementation of the collision probability computations using Cartesian coordinates requires orders of magnitude fewer function evaluations compared to a MC run.

Contact  Dr. Ryan P. Russell 512-471-4190 or ryan.russell@austin.utexas.edu