航天器调度中的资源约束推理方法  

Resource constraint reasoning methods for spacecraft scheduling

作　　者：廉振宇[1,2] 王云 陈成[2] 谭跃进[2] 

机构地区：[1]北京系统工程研究所,北京100101 [2]国防科技大学信息系统与管理学院,湖南长沙410073 [3]后勤学院,北京100101

出　　处：《国防科技大学学报》2014年第6期106-111,共6页Journal of National University of Defense Technology

基　　金：国家自然科学基金资助项目(71031007,70801062,71071156);湖南省研究生科研创新资助项目(CX2011B023);国防科技大学研究生创新资助项目(B110504)

摘　　要：资源水平边界的估计是构建资源利用可行计划中的一个基础问题。通过分析航天器资源约束的共享与分离并存、累积与瞬时消耗并存、过度订阅与区间调度并存等特点,提出了资源时间网络、时间约束网络和约束网络相结合的资源约束描述方法;构建了增量式基于包络的资源约束算法和最早开始时间链展开资源约束算法,以快速获取资源一致的柔性解。实例证明,该方法较好地解决了航天器调度的资源约束推理问题。The estimation of resource level＇s envelope is a basic problem in constructing a feasible schedule for resource utilization. A new resource reasoning description method that combining resource temporal network,constraint network and temporal network was proposed by analyzing the resource constraint characteristics,such as coexistence of sharing and detaching resource,coexistence of cumulative and instantaneous consumption,coexistence of over-subscription and interval scheduling resource. Considering the specific characteristic of resource temporal network,a resource model was constructed,and two algorithms of the EBA（ Envelop Based Algorithm） based on maximal flow and the ESTAC（ Early Start Time Algorithm with Chaining） based on early start time solution to solve with a resource feasible solution were given. The incremental EBA algorithm and ESTACalgorithm were presented to get a feasible solution quickly. Finally,some experiments were presented to prove the validity of the methods. Results show that the efficiency and validity of the proposed methods are better than EBA algorithm and ESTACalgorithm in solving the problems of resource constraint reasoning.

关 键 词：航天器 资源推理 资源时间网络 约束网络 最大流算法 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]