基于区域目标网格化的多星协同观测方法  

Multi-satellite cooperative observation method based on area target gridding

作　　者：郑起存 岳海霞 刘大成 李华 任明山 贾小雪 ZHENG Qicun;YUE Haixia;LIU Dacheng;LI Hua;REN Mingshan;JIA Xiaoxue(Aerospace Information Research Institute,Chinese Academy of Sciences,Beijing 100190,China;School of Electronic,Electrical and Communication Engineering,University of Chinese Academy of Sciences,Beijing 100049,China)

机构地区：[1]中国科学院空天信息创新研究院,北京100190 [2]中国科学院大学电子电气与通信工程学院,北京100049

出　　处：《中国科学院大学学报（中英文）》2024年第6期803-809,共7页Journal of University of Chinese Academy of Sciences

基　　金：国家自然科学基金青年科学基金(61901446)资助。

摘　　要：通过分析多颗SAR卫星对某一大面积区域目标进行协同观测的约束条件,以给定任务周期内观测收益最大为目标函数,建立约束满足模型。为改善传统的禁忌搜索算法在多星协同观测任务中易收敛于局部最优解的问题,提出一种改进的变邻域禁忌搜索算法。在算法实现的过程中,将区域目标网格化从而动态生成观测模式,并计算各模式对应的观测率。相对于传统的禁忌搜索算法,该变邻域禁忌搜索算法在同等资源下可将观测收益提高8%以上。By analyzing the constraints of using multiple SAR satellites to observe a specific large area target,the constraint satisfaction model is established to with the objective function of maximize the observation profit within a given mission time horizon.To improve the global search capabilities of the traditional tabu search algorithm,an improved tabu search algorithm with the variable neighbourhood is proposed.In implementing the algorithm with variable neighbourhood,the area target is gridded to dynamically generate observation patterns,and the observation rates corresponding to the observation patterns are calculated for each pattern.Compared to the traditional tabu search algorithm,the variable neighbourhood tabu search algorithm proposed in this paper increases the observation profit by more than 8%while maintaining the same computational burden.

关 键 词：SAR 多星协同 区域目标 变邻域禁忌搜索算法 

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