复杂约束条件下卫星观测多目标获取优化算法  

MULTI-OBJECTIVE ACQUISITION OPTIMIZATION ALGORITHM FOR SATELLITE OBSERVATION UNDER COMPLICATED CONSTRAINTS

作　　者：章登义[1] 张传功[1] 蔡波[1,2] 

机构地区：[1]武汉大学计算机学院,湖北武汉430072 [2]武汉大学信息中心,湖北武汉430072

出　　处：《计算机应用与软件》2017年第6期242-249,共8页Computer Applications and Software

基　　金：国家自然科学基金项目(41301409);国家科技支撑计划项目(2012BAH35B02)

摘　　要：在复杂约束条件下,卫星对多目标的获取效率成为卫星观测研究领域的热点问题。提出基于贪婪方法的实际复杂约束条件下多目标获取优化算法。该方法基于传感器约束模型对多目标进行可视筛选,基于卫星侧摆约束模型对可视目标实现可访问互斥目标集合分类,采用考虑能源约束模型的贪婪优化算法获取最优目标访问路径。实验结果表明,实际复杂约束条件下,该算法可在最少能源消耗情况下获取更多目标,获取效率及能耗明显优于传统的蚁群算法和遗传算法。Under the condition of complex constraints, satellite of multi-objective acquisition efficiency becomes the hot issue in the field of satellite observational studies. In this paper, a multi-objective acquisition optimization algorithm based on greedy method is proposed under practical and complex constraints. The method is based on sensor constraint model to visually screen multi-objective. Then, the method which based on satellite side swing constraint model can get accessible incompatible target set for the visual object classification. Finally, this method uses energy constraint model of greedy optimization algorithm to obtain the optimal target access path. The experimental results show that the actual complex constraint conditions, this algorithm can get more targets under the condition of minimum energy consumption and this algorithm, s efficiency is better than ant colony algorithm and genetic algorithm.

关 键 词：复杂约束 贪婪方法 多目标获取 互斥目标集合 访问路径 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]