摘要
在敏捷卫星任务规划过程中,由于对点目标的观测不需要占用整个可视时间窗口,其观测时间片段的选取成为规划过程中的关键部分,会影响整个规划结果。在选择成像片段时提出2种方法:按最早可开始时间的贪心算法和采用现有的线性规划问题的求解方法。通过在差分演化算法的迭代过程和解析过程分别结合片段选取算法,对2种片段选取方法的4种组合方式的效果进行测试,比较规划结果、运行时间和算法收敛速度3个方面的性能,从而得出最优的选取组合。实验结果表明,在差分演化算法迭代过程和解析过程分别选用贪心算法和线性规划算法选择成像片段时在规划结果、规划时间和算法收敛性3个方面综合效果最好,是一种有效的求解方法。
In the process of agile satellite mission planning,the observation time segment of point of interest does not need to occupy the entire visible time window,the selection of time segment affects the result significantly,which is the key of agile satellite mission planning.This paper proposes two methods of selecting the imaging time segment. The first one is an earliest-start-time based greedy algorithm,while the second one adopts the existing method of solving linear programming problems. Merging these two methods into the interactive process and analytic process of the agile satellite planning algorithm results in four combinations of choices. This paper tests the performance of these four combinations by comparing their planned results,the running time and the convergence rate.The results show that the most efficient combination of choices is using greedy strategy based on the earliest start time in the iterative process of planning algorithm,followed by linear programming algorithm in the final resolving process of optimal chromosome,which generates more tasks in unit time,with fast convergence rate,and relatively short running time.
作者
孙慧
李晖
赵曼
张超
应文
SUN Hui;LI Hui;ZHAO Man;ZHANG Chao;YING Wen(School of Computer Science,China University of Geosciences,Wuhan 430074,China;CETC Key Laboratory of Aerospace Information Applications,Shijiazhuang 050081,China;CETC Ocean Information Co.Ltd.,Beijing 100041,China)
出处
《无线电工程》
2018年第9期803-809,共7页
Radio Engineering
基金
装备预研联合基金资助项目(2017-HT-DD)
关键词
敏捷卫星
任务规划
观测时间片段选取
贪心算法
线性规划
agile satellite,mission planning
selection of observation time segment
greedy algorithm
linear programming
