Marcus J. Holzinger (Aerospace Engineering Department, Texas A&M University), Daniel J. Scheeres (Aerospace Engineering Sciences, University of Colorado at Boulder)
Keywords: SSA
Abstract:
History and methodology of ?v range set computation is briefly reviewed, followed by a short summary of the ?v optimal spacecraft servicing problem literature. Service vehicle placement is approached from a ?v range set viewpoint, providing a framework under which the analysis becomes quite geometric and intuitive. The optimal servicing tour design problem is shown to be a specific instantiation of the metric- Traveling Salesman Problem (TSP), which in general is an NP-hard problem. The ?v-TSP is argued to be quite similar to the Euclidean-TSP, for which approximate optimal solutions may be found in polynomial time. Applications of range sets are demonstrated using analytical and simulation results.
Date of Conference: September 13-16, 2011
Track: Poster