论文部分内容阅读
针对小卫星星座的成像特点和约束特性,建立长期任务规划数学模型。将该模型分解为初始轨道分配和冲突消解两阶段进行求解:首先将初始轨道分配问题映射为图的k-GCP模型,并提出了贪婪顶点序列着色算法进行分配;然后采用区间变量表示成像时间,根据区间变量间的时间关系对影响任务拓扑排序,设计了一种基于深度优先搜索的任务规划算法进行冲突消解。算例表明,该方法能够在满足时效性的前提下解决小卫星星座的长期任务规划问题。
According to the imaging characteristics and the restraint characteristics of small satellite constellation, a long-term mission planning mathematical model is established. The model is decomposed into two stages: initial orbit assignment and collision digestion. First, the initial orbital assignment problem is mapped to the k-GCP graph model, and a greedy vertex sequence coloring algorithm is proposed for distribution. Then interval variable is used to represent the imaging time, According to the temporal relationship among interval variables, the task scheduling algorithm based on depth-first search is designed to resolve the topological ordering of tasks. The example shows that this method can solve the problem of long-term mission planning of small satellite constellation under the premise of meeting the timeliness.