Optimal Walker Constellation Design of LEO-Based Global Navigation and Augmentation System

被引:61
作者
Guan, Meiqian [1 ]
Xu, Tianhe [1 ]
Gao, Fan [1 ]
Nie, Wenfeng [1 ]
Yang, Honglei [1 ]
机构
[1] Shandong Univ, Inst Space Sci, Weihai 264209, Peoples R China
基金
中国国家自然科学基金;
关键词
LEO-based navigation augmentation; LEO constellation design; Walker constellation; NSGA-III; ALGORITHM;
D O I
10.3390/rs12111845
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
Low Earth orbit (LEO) satellites located at altitudes of 500 km similar to 1500 km can carry much stronger signals and move faster than medium Earth orbit (MEO) satellites at about a 20,000 km altitude. Taking advantage of these features, LEO satellites promise to make contributions to navigation and positioning where global navigation satellite system (GNSS) signals are blocked as well as the rapid convergence of precise point positioning (PPP). In this paper, LEO-based optimal global navigation and augmentation constellations are designed by a non-dominated sorting genetic algorithm III (NSGA-III) and genetic algorithm (GA), respectively. Additionally, a LEO augmentation constellation with GNSS satellites included is designed using the NSGA-III. For global navigation constellations, the results demonstrate that the optimal constellations with a near-polar Walker configuration need 264, 240, 210, 210, 200, 190 and 180 satellites with altitudes of 900, 1000, 1100, 1200, 1300, 1400 and 1500 km, respectively. For global augmentation constellations at an altitude of 900 km, for instance, 72, 91, and 108 satellites are required in order to achieve a global average of four, five and six visible satellites for an elevation angle above 7 degrees with one Walker constellation. To achieve a more even coverage, a hybrid constellation with two Walker constellations is also presented. On this basis, the GDOPs (geometric dilution of precision) of the GNSS with and without an LEO constellation are compared. In addition, we prove that the computation efficiency of the constellation design can be considerably improved by using master-slave parallel computing.
引用
收藏
页数:21
相关论文
共 34 条
[1]  
BeiDou I., 2012, BEIDOU NAVIGATION SA
[2]  
Chinese Satellite Navigation Office, 2019, Development of the BeiDou navigation satellite system (Version 4.0)
[3]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[4]  
David Lawrence H.S., 2017, INNOVATION NAVIGATIO
[5]   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
[6]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[7]   A technical comparison of three low earth orbit satellite constellation systems to provide global broadband [J].
del Portillo, Inigo ;
Cameron, Bruce G. ;
Crawley, Edward F. .
ACTA ASTRONAUTICA, 2019, 159 :123-135
[8]  
Department of Deefense U.S.A., 2020, SYSTEM, DOI [10.9774/GLEAF.978-1-909493-38-4_2, DOI 10.9774/GLEAF.978-1-909493-38-4_2]
[9]   Model-Based Fault Detection and Diagnosis for Spacecraft with an Application for the SONATE Triple Cube Nano-Satellite [J].
Djebko, Kirin ;
Puppe, Frank ;
Kayal, Hakan .
AEROSPACE, 2019, 6 (10)
[10]  
Ely TA, 1999, J ASTRONAUT SCI, V47, P207