中文摘要：

针对小卫星星座的成像特点和约束特性,建立长期任务规划数学模型。将该模型分解为初始轨道分配和冲突消解两阶段进行求解：首先将初始轨道分配问题映射为图的k-GCP模型,并提出了贪婪顶点序列着色算法进行分配;然后采用区间变量表示成像时间,根据区间变量间的时间关系对影响任务拓扑排序,设计了一种基于深度优先搜索的任务规划算法进行冲突消解。算例表明,该方法能够在满足时效性的前提下解决小卫星星座的长期任务规划问题。

英文摘要：

In order to solve the long-term acquisition plan（LTAP） for small satelltes constellation,a mathematical model is constructed by analyzing the imaging characteristics and constraints of small satellites constellation.The model is divided into two sub-problems： initial orbit assignment and conflict resolution.First,initial orbit assignment is mapped into a k-GCP model and a greedy vertex sequence coloring（GVSC） algorithm is proposed to assign orbit.For the conflict resolution phase,the impacted tasks are sorted based on their temporal intervals relations.A mission planning algorithm based on depth-first search is designed to tackle the second sub-problem.The experimental result shows the proposed approach is effective in solving the LTAP for small satellites constellation.