Volume 39, Number 4, August 2021
|Page(s)||919 - 929|
|Published online||23 September 2021|
An efficient algorithm for solving the constellation-to-ground region coverage problem based on longitude strip division
School of Computer Science, China University of Geosciences(Wuhan), Wuhan 430074, China
2 Hubei Key Laboratory of Intelligent Geo-Information Processing, Wuhan 430078, China
Aiming at the constellation-to-ground region coverage problem, an efficient solution method called the longitude strip method is proposed. By dividing the ground region into several longitude strips, the latitude range of each strip is computed according to the region. Similarly, concerning the coverage area of the satellite, the latitude range of each strip is also calculated. On this basis, the coverage rate can be obtained by comprehensive statistics. Additionally, the upper and lower bounds for problems of continuous coverage and accumulative coverage are solved. Numerical simulation experiments show the proposed algorithm has higher accuracy and it is also efficient in resolving the ground area with arbitrary shapes.
Key words: satellite constellation / ground region target / coverage calculation / longitude strip method
关键字 : 卫星星座 / 区域目标 / 覆盖计算 / 经度条带法
© 2021 Journal of Northwestern Polytechnical University. All rights reserved.
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.