灵活准则地面测控资源约束满足模型研究

计算机工程与应用 ›› 2014, Vol. 50 ›› Issue (10): 260-265.

灵活准则地面测控资源约束满足模型研究

朱臻1，高永明2，王斌2

1.装备学院研究生管理大队，北京 101416
2.装备学院信息装备系，北京 101416

出版日期:2014-05-15 发布日期:2014-05-14

CSP model of ground TT&C resources scheduling with flexible principles considerations

ZHU Zhen1, GAO Yongming2, WANG Bin2

1.Company of Postgraduate Management, the Academy of Equipment, Beijing 101416, China
2.Department of Information and Equipment, the Academy of Equipment, Beijing 101416, China

Online:2014-05-15 Published:2014-05-14

摘要/Abstract

摘要： 针对地面测控资源调度中复杂约束难以描述的问题，对地面测控资源及用户需求进行详细分析。将任务分解为阶段性的需求集合，用一种时序性约束描述各类需求间的逻辑关系，给出包括设备匹配约束、时间窗口约束、地面站冲突约束、卫星竞争约束、时序逻辑约束、星载可再生资源约束六类约束的表示方法。针对不同用户从资源利用，任务完成等角度提出的需求偏好，设计了任务优先级，任务集中以及设备均衡三类原则，并进行仿真验证。初步实现了地面测控资源调度的复杂约束建模，为灵活需求偏好提供了一种设计思路。

关键词: 测控资源调度, 约束满足问题, 资源冲突, 星载可再生资源, 灵活需求

Abstract: In view of the high frequency of conflict and the complexity of constraint in ground TT&C（Tracking Telemetering and Command） resources scheduling problems, a detail analysis of resources and requests has been made. Missions are divided into collections of requests by their phases with a sequent based constraint to describe their logic. Six constraints including equipment matching constraint, time windows constraint, antenna confliction constraint, satellite competition, sequential logic constraint and consumable resource constraint are particularly expressed. To meet the vary preference from usage of resources and accomplishment of requests by different users, three heuristic principles have been added to the CSP（Constraints Satisfaction Problem） model. At the end of the paper, the model is validated by a simulation. Preliminary work has been done for modeling constraints of complex ground TT&C resources and a flexible principal is suggested.

Key words: Tracking Telemetering and Command（TT&C） scheduling, Constraints Satisfaction Problem（CSP）, resource confliction, satellite consumable resources, flexible principle

朱臻1，高永明2，王斌2. 灵活准则地面测控资源约束满足模型研究[J]. 计算机工程与应用, 2014, 50(10): 260-265.

ZHU Zhen1, GAO Yongming2, WANG Bin2. CSP model of ground TT&C resources scheduling with flexible principles considerations[J]. Computer Engineering and Applications, 2014, 50(10): 260-265.

[1]	肖成龙，聂紫阳，王珊珊. 基于ParetoHeu和实例化失败统计的关联启发式方法[J]. 计算机工程与应用, 2020, 56(5): 57-64.
[2]	崔文正. RCC8的一致分割及其算法[J]. 计算机工程与应用, 2015, 51(1): 143-150.
[3]	沈静，梅丹. 可满足实例的归结复杂度[J]. 计算机工程与应用, 2014, 50(22): 69-72.
[4]	袁际军1，黄敏镁2. 基于UML与CCSP的产品配置方法[J]. 计算机工程与应用, 2013, 49(14): 1-9.
[5]	付宏杰^1，2，3，欧阳丹彤^1，2，孙吉贵^1，2. 一种求解二元约束满足问题自适应粒子群算法[J]. 计算机工程与应用, 2009, 45(29): 10-13.
[6]	侯睿. 结合方向关系和拓扑关系的约束满足推理[J]. 计算机工程与应用, 2008, 44(16): 63-65.
[7]	郭冬芬李铁克. 约束满足技术在热轧调度板坯排序中的应用[J]. 计算机工程与应用, 2007, 43(9期): 1-3.