计算机应用与软件2017，Vol.34Issue(12)：1-7,20,8.DOI:10.3969/j.issn.1000-386x.2017.12.001
实际复杂约束条件下多星区域覆盖优化算法
MULTI-SATELLITE REGION COVERAGE OPTIMIZATION ALGORITHM UNDER REAL COMPLEX CONSTRAINTS
摘要
Abstract
Using multi-satellite co-operation to detect large area,it is required to complete the full coverage of a given target area in the shortest time,and obtain the optimal side-view observation scheme for each transit.The Existing coverage algorithm has the disadvantages of time-consuming and low efficiency technology bottleneck,spatial coverage rate and time limitations.In this paper,we took full advantage of the opportunity of each transit observation of the satellite,considering the constraints such as camera resolution,solar elevation angle and ground precision.Based on the characteristics of satellite side swing,sensor visual performance and satellite orbit parameters,the regional target was covered by quantitative coverage analysis,and the grid partitioning model was established.A coverage optimization algorithm based on one coverage strategy was proposed,which could adapt to the practical complex constraints conditions,in the actual problem scale,with good efficiency,to meet the industrial accuracy requirements.Finally,the effectiveness and adaptability of the algorithm were verified in the simulation application.关键词
成像卫星/区域目标/网格划分/多星覆盖Key words
Imaging satellite/Regional target/Grid partition/Multi-satellite coverage分类
信息技术与安全科学引用本文复制引用
章登义,王争,蔡波..实际复杂约束条件下多星区域覆盖优化算法[J].计算机应用与软件,2017,34(12):1-7,20,8.基金项目
国家科技支撑计划项目(2012BAH35B02) （2012BAH35B02）
国家自然科学基金项目(41301409) （41301409）
