航天测控调度模型及其上界求解算法  

TT&C scheduling model and its upper bound solution algorithm

作　　者：康宁[1] 武小悦[1] 

机构地区：[1]国防科学技术大学信息系统与管理学院,长沙410073

出　　处：《系统工程理论与实践》2010年第9期1695-1700,共6页Systems Engineering-Theory & Practice

摘　　要：通过分析航天测控调度问题的测控需求,建立了航天测控调度0-1整数规划模型,运用拉格朗日松弛方法对模型中的任务约束和设备约束进行了松弛,运用次梯度优化算法求得了拉格朗日对偶问题的上界.最后,通过对两个场景的试验分析,证明了次梯度优化算法所得上界的有效性.The paper analyzed TT＆C demand of TT＆C Scheduling problem and constructed a model of TT＆C Scheduling 0-1 integer programming. The model＇s task constraints and facility constraints are relaxed by lagrangian relaxation method, and obtained an upper bound of lagrangian dual problem by subgradient optimization algorithm. Finally, two examples are tested, the results demonstrate validity of upper bound obtained by subgradient optimization algorithm.

关 键 词：航天测控调度 拉格朗日松弛 次梯度优化 

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