A graph model with both edge and node having weight and the algorithm based on the label-setting shortest path algorithm is proposed to generate the imaging tasks sequence.
建立了顶点和边都带权的成像约束图模型,并提出了基于标记更新最短路算法的复杂约束成像卫星调度算法解决成像方案生成过程;对数传方案生成过程,给出背包模型并采用带回看策略的贪婪启发式方法进行问题求解。
Firstly,for the small number imaging targets,we build the directed acyclic graph model with weight on both vertexes and edges,propose a satellite imaging scheduling algorithm with complex constraints(SISACC)based on label-setting shortest path,which adopts hiberarchical dominating and the pide-and-conquer idea.
针对一类可见光对地观测卫星小问题规模下的应用,考虑上述多种约束,建立顶点和边都带权的无环路有向图模型,并基于标记更新最短路径算法,采用分层支配和分治思想,提出了复杂约束成像卫星调度算法(SISACC)进行完全路径搜索,得到问题精确解;在此基础上,给出了算法改进措施,分析了完全算法和改进方法的性质;最后通过大量实验验证了算法的适用条件和可行性。