On-Orbit Range Set Applications

Details On-Orbit Range Set Applications On-Orbit Range Set Applications

Sep 2011

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2011amos.confe..61h&link_type=abstract

Proceedings of the Advanced Maui Optical and Space Surveillance Technologies Conference, held in Wailea, Maui, Hawaii, September

Statistics

Computation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On-Orbit Range Set Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On-Orbit Range Set Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On-Orbit Range Set Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1079176