国防科技大学学报
國防科技大學學報
국방과기대학학보
JOURNAL OF NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY
2014年
6期
106-111
,共6页
廉振宇%王云%陈成%谭跃进
廉振宇%王雲%陳成%譚躍進
렴진우%왕운%진성%담약진
航天器%资源推理%资源时间网络%约束网络%最大流算法
航天器%資源推理%資源時間網絡%約束網絡%最大流算法
항천기%자원추리%자원시간망락%약속망락%최대류산법
spacecraft%resource reasoning%resource temporal network%constraint network%maximal flow algorithm
资源水平边界的估计是构建资源利用可行计划中的一个基础问题。通过分析航天器资源约束的共享与分离并存、累积与瞬时消耗并存、过度订阅与区间调度并存等特点,提出了资源时间网络、时间约束网络和约束网络相结合的资源约束描述方法;构建了增量式基于包络的资源约束算法和最早开始时间链展开资源约束算法,以快速获取资源一致的柔性解。实例证明,该方法较好地解决了航天器调度的资源约束推理问题。
資源水平邊界的估計是構建資源利用可行計劃中的一箇基礎問題。通過分析航天器資源約束的共享與分離併存、纍積與瞬時消耗併存、過度訂閱與區間調度併存等特點,提齣瞭資源時間網絡、時間約束網絡和約束網絡相結閤的資源約束描述方法;構建瞭增量式基于包絡的資源約束算法和最早開始時間鏈展開資源約束算法,以快速穫取資源一緻的柔性解。實例證明,該方法較好地解決瞭航天器調度的資源約束推理問題。
자원수평변계적고계시구건자원이용가행계화중적일개기출문제。통과분석항천기자원약속적공향여분리병존、루적여순시소모병존、과도정열여구간조도병존등특점,제출료자원시간망락、시간약속망락화약속망락상결합적자원약속묘술방법;구건료증량식기우포락적자원약속산법화최조개시시간련전개자원약속산법,이쾌속획취자원일치적유성해。실예증명,해방법교호지해결료항천기조도적자원약속추리문제。
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.