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
² Hubei Key Laboratory of Intelligent Geo-Information Processing, Wuhan 430078, China

Received: 15 November 2020

Abstract

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.

摘要

针对卫星星座对地面区域的覆盖问题，提出一种快速求解方法—经度条带法。将地面目标划分为若干个经度条带，并根据区域得到每个条带的纬度范围，根据卫星覆盖范围，计算星座对每个条带的覆盖情况，综合统计得到覆盖率。结合覆盖率上下界的思想，对连续性覆盖问题和累积覆盖问题的覆盖率上下界形式进行求解。数值仿真实验反映了该算法计算结果的精确性，能够对任意形状地面区域进行求解，计算效率较高。