| 引用本文: | 廉振宇,王云,陈成,等.航天器调度中的资源约束推理方法.[J].国防科技大学学报,2014,36(6):106-111.[点击复制] |
| LIAN Zhenyu,WANG Yun,CHEN Cheng,et al.Resource constraint reasoning methods for spacecraft scheduling[J].Journal of National University of Defense Technology,2014,36(6):106-111[点击复制] |
|
| |
|
|
| 本文已被：浏览 9171次 下载 7053次 |
| 航天器调度中的资源约束推理方法 |
| 廉振宇1,2, 王云3, 陈成2, 谭跃进2 |
|
(1.北京系统工程研究所， 北京 100101;2.3.国防科技大学 信息系统与管理学院，湖南 长沙 410073;3.2.后勤学院， 北京 100101)
|
| 摘要: |
| 资源水平边界的估计是构建资源利用可行计划中的一个基础问题。通过分析航天器资源约束的共享与分离并存、累积与瞬时消耗并存、过度订阅与区间调度并存等特点，提出了资源时间网络、时间约束网络和约束网络相结合的资源约束描述方法；构建了增量式基于包络的资源约束算法和最早开始时间链展开资源约束算法，以快速获取资源一致的柔性解。实例证明，该方法较好地解决了航天器调度的资源约束推理问题。 |
| 关键词: 航天器 资源推理 资源时间网络 约束网络 最大流算法 |
| DOI：10.11887/j.cn.201406019 |
| 投稿日期：2014-02-27 |
| 基金项目:国家自然科学基金资助项目（71031007，70801062，71071156）；湖南省研究生科研创新资助项目（CX2011B023）；国防科技大学研究生创新资助项目（B110504） |
|
| Resource constraint reasoning methods for spacecraft scheduling |
| LIAN Zhenyu1,2, WANG Yun3, CHEN Cheng2, TAN Yuejin2 |
|
(1. Beijing Institute of System Engineering , Beijing 100101 China;2.3. College of Information System and Management, National University of Defense Technology, Changsha 410073, China;3.2. College of Logistics， Beijing 100101，China)
|
| Abstract: |
| 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 ESTAc algorithm 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 ESTAc algorithm in solving the problems of resource constraint reasoning. |
| Keywords: spacecraft resource reasoning resource temporal network constraint network maximal flow algorithm |
|
|
|
|
|
