Optimal visitation order for spacecraft servicing missions

Brian J. Wadsley, Robert G. Melton

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations


The problem of visiting a set of satellites for servicing (repair/refueling) can be formulated as a Wandering Salesman Problem (unconstrained start and end points). Other researchers have shown that for closely neighboring orbital planes, the problem is simplified by examining the orbital angular momenta projected onto a common plane. This paper approaches the problem using a dynamic programming algorithm and addresses situations where perturbations have significant effect across the lifetime of the mission, and/or the orbital planes have substantially different inclinations.

Original languageEnglish (US)
Title of host publicationAstrodynamics 2007 - Advances in the Astronautical Sciences, Proceedings of the AAS/AIAA Astrodynamics Specialist Conference
Number of pages19
StatePublished - Dec 1 2008

Publication series

NameAdvances in the Astronautical Sciences
Volume129 PART 3
ISSN (Print)0065-3438

All Science Journal Classification (ASJC) codes

  • Aerospace Engineering
  • Space and Planetary Science


Dive into the research topics of 'Optimal visitation order for spacecraft servicing missions'. Together they form a unique fingerprint.

Cite this