CubeSats provide a cost effective means to perform scientific and technological studies in space. Due to their affordability, CubeSat technologies have been diversely studied and developed by educational institutions, companies and space organizations all over the world. The CubeSat technology that is surveyed in this paper is the propulsion system. A propulsion system is the primary mobility device of a spacecraft and helps with orbit modifications and attitude control. This paper provides an overview of micro-propulsion technologies that have been developed or are currently being developed for CubeSats. Some of the micro-propulsion technologies listed have also flown as secondary propulsion systems on larger spacecraft. Operating principles and key design considerations for each class of propulsion system are outlined. Finally, the performance factors of micro-propulsion systems have been summarized in terms of: first, a comparison of thrust and specific impulse for all propulsion systems; second, a comparison of power and specific impulse, as also thrust-to-power ratio and specific impulse for electric propulsion systems.
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.
In this paper we revisit the problem of peer-to-peer refueling of a satellite constellation in orbit with propellant. In particular, we propose the egalitarian peer-to-peer refueling strategy that relaxes the restriction on the active satellites to return to their original orbital slots after all fuel exchanges have been completed. We formulate the problem as a minimum cost flow problem in the so-called constellation network, and minimize the total V subject to flow balance constraints, along with certain additional constraints introduced to avoid conflicts between active and passive satellites. Recognizing that the actual objective is to minimize the total fuel expenditure, instead of V, we also propose a method to improve the results by performing a local search around the minimum-V solution. We also provide explicit upper and lower bounds on the suboptimality of the obtained results. With the help of numerical examples, it is shown that the proposed egalitarian peer-to-peer refueling strategy leads to considerable reduction in terms of the total fuel expenditure over the baseline peer-to-peer strategy.
The problem of a general peer-to-peer refueling strategy for satellites in a circular constellation is addressed. The proposed cooperative egalitarian peer-to-peer strategy allows the satellites participating in a refueling transaction to engage in a cooperative rendezvous, that is, both satellites engaging in a fuel exchange may be active. Furthermore, the active satellites are allowed to interchange their orbital positions during their respective return trips. A mathematical framework to solve this general refueling problem for a large number of satellites is proposed using ideas from network flow theory. The methodology determines the optimal set of maneuvers that achieve fuelsufficiency for all satellites, while expending the minimum possible fuel during the ensuing orbital transfers. With the help of numerical examples it is shown that the proposed cooperative egalitarian peer-to-peer strategy is the best amongst all known peer-to-peer refueling alternatives to date.
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.