A Cooperative P2P Refueling Strategy for Circular Satellite Constellations

Abstract

In this paper, we discuss the problem of peer-to-peer (P2P) refueling of satellites in a circular constellation. In particular, we propose a cooperative P2P (C-P2P) refueling strategy, in which the satellites involved in P2P maneuvers are allowed to engage in cooperative rendezvous. We discuss a formulation of the proposed C-P2P strategy and a methodology to determine the optimal C-P2P assignments. We show that in order to reduce the fuel expenditure in a C-P2P maneuver, the amount of fuel exchanged between the two satellites is such that the satellite performing the larger-ΔV transfer during the return trip, ends up having just enough amount of fuel to be fuel-sufficient. Finally, with the help of numerical examples, we provide a comparison of the P2P and the C-P2P refueling strategies. It is found that a C-P2P strategy is beneficial when the fuel-deficient satellites in the constellation do not have enough fuel to complete a non-cooperative rendezvous.

Peer-to-Peer Refueling Strategy Using Low-Thrust Propulsion

“…The P2P refueling problem can be efficiently formulated using constellation graphs [27,30], in which each node represents an orbital slot, and an edge represents a P2P maneuver between the satellites occupying the slots. We follow the same approach in this paper.…”

“…We have the following optimization problem that yields the optimal P2P solution (for details, see Dutta and Tsiotras [30]):…”

“…Given a set of fuel-sufficient and fuel-deficient satellites, the problem of P2P refueling seeks to determine the satellite pairs that minimize the total fuel expended during all P2P maneuvers. Previous studies on P2P refueling [23,[25][26][27][28][29][30] have considered that the satellites employ chemical propulsion systems, so that the maneuvers are impulsive in nature. In particular, these studies have considered that each orbital maneuver is an optimal two-impulse transfer, which can be determined by computing multirevolution solutions to Lambert's problem.…”

Network Flow Formulation for Cooperative Peer-to-Peer Refueling Strategies

“…The basic assumption during such a strategy is that all satellites are identical, performing the same functions, and thereby can replace each other in orbit. The other extension of the P2P refueling problem allows for cooperative rendezvous between satellites engaging in a refueling transaction [43,44]. [43] assumed that all satellites participating in the refueling process are in the same circular orbit.…”

“…The other extension of the P2P refueling problem allows for cooperative rendezvous between satellites engaging in a refueling transaction [43,44]. [43] assumed that all satellites participating in the refueling process are in the same circular orbit. [44] removed this assumption, by allowing the satellites to be in different circular orbits.…”