In this paper, we study pure peer-to-peer (henceforth abbreviated as P2P) and mixed (combined single-spacecraft and P2P) satellite refueling in circular orbit constellations comprised of multiple satellites. We consider the optimization of two conflicting objectives in the refueling problem and show that the cost function we choose to determine the optimal refueling schedule reflects a reasonable compromise between these two conflicting objectives. In addition, we show that equal time distribution between the forward and return flights for each pair of P2P maneuvers does not necessarily lead to the optimum cost. Based on this idea, we propose a strategy for reducing the cost of P2P maneuvers. This strategy is applied to pure P2P refueling scenarios as well as to mixed refueling scenarios. Furthermore, for the case of a mixed scenario, we propose an asynchronous P2P strategy that also leads to more efficient refueling.
展开▼
