Developing novel multi-plane satellite constellation deployment methods using the concept of nodal precession

被引:10
作者
Mahdisoozani, Hojat [1 ]
Bakhtiari, Majid [2 ]
Daneshjoo, Kamran [1 ]
机构
[1] Iran Univ Sci & Technol, Sch Mech Engn, Tehran, Iran
[2] Iran Univ Sci & Technol, Sch Adv Technol, Tehran, Iran
关键词
Satellite constellation deployment; Nodal precession; Multi-objective optimization; Total deployment time; Deployment deltaV; NANOSATELLITE CONSTELLATION; DESIGN; LAUNCH;
D O I
10.1016/j.asr.2021.06.010
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
Deployment of multi-plane satellite constellations has become a fresh challenge in the space program missions since all the direct solutions including plane changing maneuvers and separate launches are energy and time-consuming. A proposed solution to this challenge is launching several satellites simultaneously and deploying them using gravitational perturbations of the Earth. Utilizing this solutions, only in-plane satellite maneuvers are sufficient to deploy a constellation of satellites in several orbital planes. The aim of this study is to extend and develop the present methods that use the concept of nodal precession to deploy a multi-plane satellite constellation with only one launch in order to cover a wider range of mission specifications, provide mathematical expressions for the total deployment time and the fuel expenditure of these methods, optimize the methods multi-objectively and provide a thorough analysis and comparison between them. Two general methods are proposed in this study; one that places all the satellites in a parking orbit and injects them into their final orbits sequentially, and one that first places them in different drifting orbits and after a certain amount of time, maneuvers them to their final orbits. The findings of the optimization process suggest that the method which involves all the satellites in the process of deployment simultaneously and by this means exploits the full nodal precessing potential of all of them provides better results in comparison with the method with a more passive approach, which considers the deployment a sequential process. Finally, since this mathematical modeling is performed for the first time in the literature, the mathematical expressions for both methods are analyzed to provide beneficial insights for the designers. (C) 2021 COSPAR. Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:3141 / 3158
页数:18
相关论文
共 25 条
[1]   Techniques for deploying elliptically orbiting constellations in along-track formation [J].
Bainum, PM ;
Strong, A ;
Tan, ZZ ;
Capó-Lugo, PA .
ACTA ASTRONAUTICA, 2005, 57 (09) :685-697
[2]   The features of constellations' formation and replenishment at near circular orbits in non-central gravity fields [J].
Baranov, Andrey A. ;
Grishko, Dmitriy A. ;
Mayorova, Vera I. .
ACTA ASTRONAUTICA, 2015, 116 :307-317
[3]   Design and deployment of a satellite constellation using collaborative optimization [J].
Budianto, IA ;
Olds, JR .
JOURNAL OF SPACECRAFT AND ROCKETS, 2004, 41 (06) :956-963
[4]   Assessment of constellation designs for earth observation: Application to the TROPICS mission [J].
Buzzi, Pau Garcia ;
Selva, Daniel ;
Hitomi, Nozomi ;
Blackwell, William J. .
ACTA ASTRONAUTICA, 2019, 161 :166-182
[5]  
Carlo M. D., 2016, AIAA AAS ASTR SPEC C
[6]   Satellite constellation mission analysis and design [J].
Cornara, S ;
Beech, TW ;
Belló-Mora, M ;
Janin, G .
ACTA ASTRONAUTICA, 2001, 48 (5-12) :681-691
[7]   An integrated design methodology for the deployment of constellations of small satellites [J].
Crisp, N. H. ;
Smith, K. L. ;
Hollingsworth, P. M. .
AERONAUTICAL JOURNAL, 2019, 123 (1266) :1193-1215
[8]   Launch and deployment of distributed small satellite systems [J].
Crisp, N. H. ;
Smith, K. ;
Hollingsworth, P. .
ACTA ASTRONAUTICA, 2015, 114 :65-78
[9]  
Curtis H.D, 2005, CHOICE REV ONLINE, DOI [10.5860/choice.42-6517, DOI 10.5860/CHOICE.42-6517]
[10]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197