考虑邻域结构动态调整的多星应急调度算法

实际应用中的卫星调度方案往往受到外界因素的影响,例如电磁干扰、卫星失效、云层遮挡以及新任务的动态到达等,需要在短时间内对原始调度方案进行调整并生成新的调度方案,以保证卫星系统的稳定性.对此,考虑新任务到达情况下的卫星应急调度,建立多星协同应急调度的整数规划模型,并提出一种基于动态邻域结构的卫星应急调度算法(satellite emergency scheduling algorithm based on dynamic neighborhood, SESA-DN).设计多种类型的邻域结构以及动态的邻域选择策略,能够根据任务完成情况进行有效反馈,通过对应急任务的插入与替换生成卫星应急调度方案;同时,构建多星应急调度场景,通过大量仿真实验将SESA-DN算法与多种对比算法进行比较.实验结果表明, SESA-DN算法的稳定性优于对比算法,对于多星协同动态调度问题具有很好的适用性.

Multi-satellite emergency scheduling algorithm considering dynamic selection of neighborhood structure

The satellite scheduling schemes in practical applications are typically affected by external factors, such as electromagnetic interference, satellite failure, cloud cover, and the dynamic arrival of new tasks, etc. It is necessary to adjust the original scheduling scheme within a short time and generate a new scheduling scheme to ensure the stability of the satellite system. Therefore, considering satellite emergency scheduling when new tasks arrived, this paper establishes an integer programming model for multi-satellite cooperative observation emergency scheduling, and proposes a satellite emergency scheduling algorithm based on a dynamic neighborhood(SESA-DN). This method designs various types of neighborhood structures and dynamic neighborhood selection strategies, which can provide effective feedback in terms of the completion of tasks, and generate satellite emergency scheduling schemes by inserting and replacing emergency tasks. Besides, a multi-satellite emergency scheduling scenario is constructed, and the proposed SESA-DN algorithm is compared with multiple comparison algorithms through a large number of simulation experiments. Experimental results show that the SESA-DN algorithm is more stable than comparison algorithms, and has good applicability to the multi-satellite cooperative dynamic scheduling problem.