巨型星座覆盖分析方法及性能研究 | |
Alternative Title | Research on Coverage Analysis Method and Performance of Mega-Constellation |
吕林立 | |
Thesis Advisor | 李文皓 |
2021-05-26 | |
Degree Grantor | 中国科学院大学 |
Place of Conferral | 北京 |
Subtype | 硕士 |
Degree Discipline | 一般力学与力学基础 |
Keyword | 巨型星座,墨卡托投影图叠加法,计算效率分析,覆盖性变化规律 |
Abstract | 近年来随着商业航天的蓬勃发展,巨型星座网络在建设、组网、服务等多方面取得快速进展,星座覆盖性分析是实现巨型星座预期服务的前提。由于计算精度与卫星数量间的关联约束,传统星座覆盖性分析方法的计算效率受其计算精度的影响巨大,尤其对于新兴巨型星座,由于卫星数量庞大,当计算精度提高时,算法计算消耗将显著增加。本文提出墨卡托投影图叠加法(MPS),算法以墨卡托覆盖图为基础,结合图像处理算法,基本解除了星座卫星数量与计算精度对计算效率的关联约束,有效降低了卫星数量对计算消耗的影响。另外,关于星座覆盖性能随参数变化规律的研究将为星座设计等工作提供参考。本文主要就以下内容进行了研究: (1)建立了卫星覆盖模型,提出了覆盖性衡量指标。首先,基于传感器任务及特性分别建立了卫星对地,对天覆盖几何模型,并给出其表达式,该模型可分别用于研究星座对地覆盖,星间建链等问题。其次,从二体问题出发研究了卫星的运行轨道、运动方程及星下点轨迹,为获取卫星墨卡托投影图上覆盖域打下基础。然后,推导了墨卡托投影图的坐标转换公式,为后续覆盖域投影、像元面积求解做基础。最后,提出了一套星座覆盖性分析指标,为星座是否符合覆盖任务需求提供判别依据。 (2)提出了巨型星座覆盖性高效分析算法MPS。首先给出了MPS算法的具体实现步骤,分别给出了单星墨卡托覆盖图、星座墨卡托覆盖图具体编码方式,定义了各重覆盖矩阵、星座覆盖指标并给出了相应计算公式。其次,分别对传统网格法(GPA)和MPS算法进行了计算消耗的理论分析,并基于实验结果进行了MPS算法效率验证,结果表明MPS算法基本解除了卫星数量和计算精度对计算消耗的影响,并有效降低了卫星数量对计算耗时的影响系数。最后,基于上述理论分析结果,定义了MPS相对GPA算法消耗比,从而对比了两种算法的计算效率。设计了三类算例,研究了两种算法对现有典型星座或其子星座、卫星总数量恒定变星座构型、变卫星数量下的计算误差及计算消耗。 (3)研究了低轨Walker星座覆盖性变化规律。首先,基于StarLink低轨子星座参数,分析了低轨Walker星座在高度、倾角变化下,单轨道周期内星座对地1-6重覆盖率和总覆盖率的变化规律。其次,基于StarLink星座参数,研究了低轨Walker星座覆盖性随轨道高度、倾角、星座构型、卫星总数量变化规律。最后,针对StarLink向美国联邦通信委员会(FCC)申请的多次星座修订提案,探究了其参数修改原因。 |
Other Abstract | In recent years, with the vigorous development of commercial aerospace, mega-constellations have made rapid progress in construction, networking, and services. Constellation coverage analysis is a prerequisite for realizing the expected services of mega constellations. Due to the associated constraint between the calculation accuracy and the number of satellites, the calculation efficiency of the traditional constellation coverage analysis method is greatly affected by its calculation accuracy, especially for the emerging mega constellations, due to the large number of satellites, when the calculation accuracy is improved, the calculation cost of the algorithm will be significant. increase. This paper proposes the Mercator projection superposition method (MPS). The algorithm is based on the Mercator coverage map and combined with the image processing algorithm. This basically removes the constraint of the number of constellation satellites and the calculation accuracy on the calculation efficiency, and effectively reduces the number of satellites. Calculate the impact of consumption. In addition, the study of constellation coverage performance changes with parameters will provide references for constellation design and other work. This article mainly studies the following contents: (1) Established a satellite coverage model and proposed coverage metrics. Firstly, based on sensor tasks and characteristics, geometric models of satellite-to-earth and satellite -to-sky coverage are established, and their expressions are given. The models can be used to study constellation-to-ground coverage and inter-satellite link building. Secondly, starting from the two-body problem, the satellite's orbit, motion equation and sub-satellite point trajectory are studied to lay the foundation for obtaining the coverage area on the satellite Mercator projection map. Then, the coordinate conversion formula of the Mercator projection map is deduced, which lays the foundation for the subsequent coverage area projection and pixel area calculation. Finally, a set of constellation coverage analysis indicators are proposed to provide a basis for judging whether the constellation meets the requirements of coverage tasks. (2) The MPS, an efficient analysis algorithm for mega constellation coverage, is proposed. First, the specific implementation steps of the MPS algorithm are given. The specific coding methods of the single-satellite Mercator coverage map and the constellation Mercator coverage map are respectively given, and the multiple coverage matrices and constellation coverage indicators are defined and the corresponding calculation formulas are given. . Secondly, the theoretical analysis of the computational consumption of the GPA algorithm and the MPS algorithm are carried out, and the efficiency of the MPS algorithm is verified based on the experimental results. The results show that the MPS algorithm basically removes the influence of the number of satellites and calculation accuracy on the computational consumption, and effectively reduces The influence coefficient of the number of satellites on the calculation time. Finally, based on the above theoretical analysis results, the consumption ratio of MPS and GPA algorithms is defined, thereby comparing the computational efficiency of the two algorithms. Three types of calculation examples are designed, and the calculation errors and calculation costs of the two algorithms for the existing typical constellation or its sub-constellations, the total number of satellites are constant, the constellation configuration, and the number of satellites are changed. (3) The coverage changes of the low-orbit Walker constellation are studied. First, based on the parameters of the StarLink low-orbit sub-constellation, the changes of the low-orbit Walker constellation under the change of altitude and inclination angle, the constellation's 1-6 ground coverage and total coverage in a single orbit period are analyzed. Secondly, based on the StarLink constellation parameters, the changes in the coverage of the LEO Walker constellation with the orbit height, inclination angle, constellation configuration, and total number of satellites are studied. Finally, in response to the multiple constellation revision proposals that StarLink applied to the US Federal Communications Commission (FCC), the reasons for the modification of its parameters were explored. |
Language | 中文 |
Document Type | 学位论文 |
Identifier | http://dspace.imech.ac.cn/handle/311007/86616 |
Collection | 先进制造工艺力学实验室 |
Recommended Citation GB/T 7714 | 吕林立. 巨型星座覆盖分析方法及性能研究[D]. 北京. 中国科学院大学,2021. |
Files in This Item: | ||||||
File Name/Size | DocType | Version | Access | License | ||
76534.pdf(7201KB) | 学位论文 | 开放获取 | CC BY-NC-SA | Application Full Text |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment