|
Abstract:
Given an initial orbit and a set of other orbits of interest, the lowest change in velocity path between them is of high value. Software was developed to visualize the change in velocity required from a user defined window of burn to a user defined window of intercept. The time between burn and intercept is unrestricted. Multiple intercepts require searching an n! solution space, research then is focused on ways to pick optimal choices without fully calculating out the cost of doing all possible combinations. Some code was translated from BASIC and the rest was newly developed in MATLAB. The code was validated using orbits with known intercept solutions.
| Limitations: |
APPROVED FOR PUBLIC RELEASE |
| Description: |
Master's thesis |
| Pages: |
70 |
| Report Date: |
Mar-2009 |
| Report Number: |
A087694 |
|
|
|
|
|