基于经度条带划分的星座对地覆盖问题的快速求解算法  

An efficient algorithm for solving the constellation-to-ground region coverage problem based on longitude strip division

作　　者：宋志明[1,2] 刘海栋 陈晓宇 王茂才[1,2] SONG Zhiming;LIU Haidong;CHEN Xiaoyu;WANG Maocai(School of Computer Science,China University of Geosciences(Wuhan),Wuhan 430074,China;Hubei Key Laboratory of Intelligent Geo-Information Processing,Wuhan 430078,China)

机构地区：[1]中国地质大学(武汉)计算机学院,湖北武汉430074 [2]智能地学信息处理湖北省重点实验室,湖北武汉430078

出　　处：《西北工业大学学报》2021年第4期919-929,共11页Journal of Northwestern Polytechnical University

基　　金：国家重点研发计划(2016YFB0501001);中国博士后科学基金(2019TQ0291);航空科学基金(2018ZCZ2002);湖北省自然科学基金(2019CFB376);智能地学信息处理湖北省重点实验室开放研究课题(KLIGIP-2019B07)资助。

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

关 键 词：卫星星座 区域目标 覆盖计算 经度条带法 

分 类 号：V474[航空宇航科学与技术—飞行器设计]