@inproceedings{e68baaef27a940549f14547a458bbc35,
title = "Optimal visitation order for spacecraft servicing missions",
abstract = "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.",
author = "Wadsley, {Brian J.} and Melton, {Robert G.}",
year = "2008",
language = "English (US)",
isbn = "9780877035435",
series = "Advances in the Astronautical Sciences",
pages = "2705--2723",
booktitle = "Astrodynamics 2007 - Advances in the Astronautical Sciences, Proceedings of the AAS/AIAA Astrodynamics Specialist Conference",
}