引用本文格式: 徐明明,王俊峰. 基于冲突成像概率的多星任务预调度算法 [J]. 四川大学学报: 自然科学版, 2020, 57: 894~902.
 
基于冲突成像概率的多星任务预调度算法
A Collision Probability-Based Algorithm for Multi-Satellites Task Pre-Scheduling Problem
摘要点击 241  全文点击 38  投稿时间:2019-08-28  修订日期:2019-12-16
查看全文  查看/发表评论  下载PDF阅读器
DOI编号   
中文关键词   对地观测  预调度    组合优化
英文关键词   Earth observation  Pre-scheduling  Graph  Constrain optimization
基金项目   四川省重点研发计划项目(2018GZ0529); 四川省重大科技专项(19ZDZX0024); 国家自然科学基金(91338107)
作者单位E-mail
徐明明 四川大学计算机学院 245561368@qq.com 
王俊峰 四川大学空天科学与工程学院 成都 610065 wangjf@scu.edu.cn 
Author NameAffiliationE-mail
XU Ming-Ming College of Computer Science, Sichuan University, Chengdu 610065, China 245561368@qq.com 
WANG Jun-Feng School of Aeronautics and Astronautics, Sichuan University, Chengdu 610065, China wangjf@scu.edu.cn 
中文摘要
    研究高效的卫星调度算法对于解决任务分配不合理问题,充分利用卫星资源收集地面信息,提高对地观测系统的效率具有重要意义.本文针对多星分布式协同调度模型的第一阶段预调度问题,考虑卫星性能指标和成像约束条件,将多星调度问题分解为单星自主调度问题.为求解该问题,本文通过计算任务的可用时间窗口之间的潜在冲突系数和实际冲突系数及能量系数,提出一种基于冲突成像概率的调度(Collision Imaging Probability Based Schedule,CIPBS)算法,根据可用时间窗口分布特点预测每个任务被每颗卫星成功调度的概率,从而设计任务分配方案,尽可能提高能被成像任务的总权重.本文设计了3种不同分布的任务场景来评估CIPBS算法的适应性和效率,实验结果表明均有10%~20%的性能提升.
英文摘要
    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%.

您是第 Guest 位访问者

版权所有 @ 2007《四川大学学报 (自然科学版)》编辑部
地址: 四川省成都市武侯区四川大学望江校区文科楼330至342室  邮编: 610064
电话: (028)85410393  传真: (028)85410393  E-mail: scdx@scu.edu.cn
本系统由北京勤云科技发展有限公司设计