Satellite Mission Planning Method Based on Disjoint Set Search
WANG Yu-Qi 1, 2WANG Hai-Qiang1 LIU Dan1ZHONG Xiao-Qing 1, 2HAN Xiao-Dong1
1． Institute of Telecommunication and Navigation Satellite, China Academy of Space Technology, Beijing 100094, China 2． Peng Cheng Laboratory, Shenzhen Guangdong 518000, China
Abstract：Rapid remote sensing mission planning based on observation mission requirements and remote sensing satellite capabilities can greatly improve the observation efficiency of remote sensing mission. In order to solve the problem of low efficiency when traditional methods are applied to large-scale mission planning, a discrete mission planning graph model is established. A satellite remote sensing mission planning method based on disjoint set search is proposed. The large-scale mission planning problem is divided into several solvable sub-problems by means of disjoint set search. The method can reduce the computational complexity and improve the efficiency of solution while ensuring the quality of solution. The simulation results show that compared with the traditional mixed integer linear programming method, the method based on disjoint set search has good practicability and optimization effect under the condition of low degree of mission conflict. It can reduce the model solution time by 28 % ∼ 45 %.
王雨琦, 王海强, 刘丹, 仲小清, 韩笑冬. 基于并查集搜索的卫星任务规划方法[J]. 指挥与控制学报, 2021, 7(3): 269-274.
WANG Yu-Qi, WANG Hai-Qiang, LIU Dan, ZHONG Xiao-Qing, HAN Xiao-Dong. Satellite Mission Planning Method Based on Disjoint Set Search. Journal of Command and Control, 2021, 7(3): 269-274.
2021, Vol. 7 
