Analysis of responsive satellite manoeuvres using graph theoretical techniques

Tools

McGrath, Ciara N. and Clark, Ruaridh A. and Macdonald, Malcolm (2019) Analysis of responsive satellite manoeuvres using graph theoretical techniques. In: International workshop on satellite constellations and formation flying, 2019-07-16 - 2019-07-19, University of Strathclyde.

[thumbnail of McGrath-etal-IWSCFF-2019-Analysis-of-responsive-satellite-manoeuvres-using-graph]
Preview
 Text. Filename: McGrath_etal_IWSCFF_2019_Analysis_of_responsive_satellite_manoeuvres_using_graph.pdf
Accepted Author Manuscript
Download (776kB)| Preview

Abstract

Manoeuvrable, responsive satellite constellations that can respond to real-time events could provide critical data on-demand to support, for example, disaster monitoring and relief efforts. The authors demonstrate the feasibil-ity of such a system by expanding on a fully-analytical method for designing responsive spacecraft manoeuvres using low-thrust propulsion. This method enables responsive manoeuvre planning to provide coverage of targets on the Earth, with each manoeuvre option having a different target look angle, and requiring a different manoeuvre time and propellant cost. The trade-space for this analysis rapidly expands when considering multiple space-craft, targets and manoeuvres. To explore the trade-space efficiently, it is perceived as a graph in which connections are rapidly traversed to identify favourable routes to achieve the mission goals. The case study presented considers four satellites required to provide flyovers of two targets, with an associated graph of possible manoeuvres comprising 10726 nodes. The min-imum time solution is 2.59 days to complete both flyovers with 7.037 m/s change in velocity. Investigation of the graph highlights that selecting a good but not minimum time solution can allow the system to perform well but also have alternate options available to deal with possible errors in the manoeuvre execution, or changes in mission priorities. Restricting the prob-lem to consider only two satellites, with a smaller swath and less available propellant, reduces the graph to 510 nodes. In this case, the minimum time solution requires 9.04 m/s velocity change and takes approximately 2.59 days. The analysis also provides non-intuitive solutions, for example, that it is faster for one satellite to perform two targeting manoeuvres than for two satellites to manoeuvre simultaneously.

ORCID iDs

McGrath, Ciara N. ORCID logoORCID: https://orcid.org/0000-0002-7540-7476, Clark, Ruaridh A. ORCID logoORCID: https://orcid.org/0000-0003-4601-2085 and Macdonald, Malcolm ORCID logoORCID: https://orcid.org/0000-0003-4499-4281;
CORE (COnnecting REpositories)