考虑目标间不同转换方式的成像卫星调度

摘要

Considering the different transition modes of any two adjacent targets observed by a satellite, the complex scheduling constraints including slewing time, storage capcity and power are analyzed in this paper. Also, the acyclic directed graph model with a dynamic topological structure is established. In addition, the concept of constraint non-dominant path is proposed, and a dynamic path search algorithm ( DPSA) based on label update is suggested. Experimental results show that the DPSA algorithm can greatly improve the scheduling quality at the expense of timing complexity and space complexity.%针对相邻目标间具有不同转换方式的成像卫星调度问题,分析动作转换时间、存储容量、卫星能量等复杂约束,建立动态拓扑结构无环路有向图模型,引入非约束支配路径的概念,提出基于标记更新思想的动态路径搜索算法(DPSA)对问题进行求解.实验结果表明,考虑目标间不同转换方式的DPSA算法在牺牲一定求解效率的基础上,能够全面提高调度效果.