基于冲突成像概率的多星任务预调度算法

A Collision Probability-Based Algorithm for Multi-Satellites Task Pre-Scheduling Problem

摘要:

研究高效的卫星调度算法对于解决任务分配不合理问题，充分利用卫星资源收集地面信息，提高对地观测系统的效率具有重要意义.本文针对多星分布式协同调度模型的第一阶段预调度问题，考虑卫星性能指标和成像约束条件，将多星调度问题分解为单星自主调度问题.为求解该问题，本文通过计算任务的可用时间窗口之间的潜在冲突系数和实际冲突系数及能量系数，提出一种基于冲突成像概率的调度（Collision Imaging ProbabilityBased Schedule，CIPBS）算法，根据可用时间窗口分布特点预测每个任务被每颗卫星成功调度的概率，从而设计任务分配方案，尽可能提高能被成像任务的总权重.本文设计了3种不同分布的任务场景来评估CIPBS算法的适应性和效率，实验结果表明均有10%～20%的性能提升.

Abstract:

It is of great significance to study the efficient satellite scheduling algorithm to solve the problem of unreasonable task assignment and make full use of satellite resources to collect ground information， and improve the efficiency of the Earth observation system. Aiming at the first stage prescheduling problem of multistar distributed cooperative scheduling, the multistar scheduling problem is decomposed in the paper into a singlestar autonomous scheduling problem under the satellite performance and imaging constraints. In order to solve the problem, a collision imaging probabilitybased schedule (CIPBS) algorithm is proposed by computing the real conflict coefficient, potential conflict coefficient, and energy allocation coefficient between the available time windows of the task, imaging probabilities of each task scheduling successfully by each satellite is predicted based on the distribution features of available time window, so the task assignment plan is designed to maximize the total weight of tasks that can be imaged. In this paper, three different types of task scenarios are designed to evaluate the adaptability and efficiency of the CIPBS algorithm. The experimental results show that the performance is improved by 10% to 20%.