侦察卫星探测资源调度研究

侦察卫星探测资源调度是一类基于约束满足的优化问题。对卫星探测资源和探测任务的特点进行分析,在此基础上构建卫星探测资源调度的目标函数和约束条件,利用约束满足问题的建模思想对该调度问题进行建模。针对约束满足模型规模大、求解复杂的情况,结合卫星探测资源调度问题的特征,提出一种基于启发式禁忌搜索算法的模型求解方法,并通过仿真算例进行说明与分析。该调度模型和算法充分考虑了星载资源与对应任务的特点,尽量回避假设与简化条件的提出,具有较好的适用性,将为侦察与预警卫星网络任务规划与资源调度的研究奠定基础。

Research on reconnaissance satellite detector scheduling

Reconnaissance satellite detector scheduling is a constraints satisfaction problem.Traits of satellite detectors and detecting tasks are analyzed,the object function and constraints of CSP model are built and a mathematic model for the problem is given.The CSP model is a NP-hard problem and is hard to solve,so a heuristic mechanism for the model based on tabu search algorithm is designed.A simulation is developed to deduce and analyze the model and the algorithm.The model and the algorithm make little hypothesis and simplification,and supply better applicability.The outcome of this article founds the basis for our future work on task programming and resource scheduling of the detecting and early-warning satellite network.