航天TT&C调度的拉格朗日松弛策略  

Lagrangian Relaxation Strategy for Aerospace TT&C Schedule

作　　者：康宁[1] 武小悦[1] 陈杨[2] 

机构地区：[1]国防科学技术大学信息系统与管理学院,长沙410073 [2]北京跟踪与通信技术研究所,北京100094

出　　处：《计算机工程》2011年第19期283-285,共3页Computer Engineering

摘　　要：根据航天遥测、跟踪和指挥(TT&C)调度的测控需求,建立航天测控调度问题的0-1整数规划模型,运用(λ,ν)、(μ,ν)和(λ,μ)3种策略对模型中的约束进行松弛,通过次梯度优化算法求得每种松弛问题的上界。利用2个场景验证上界(目标函数值)的有效性,调度结果表明,3种松弛策略中以次梯度优化算法得到的上界差别最小。This paper analyzes Telemetry, Track and Command（TT＆C） requirement of TT＆C schedule problem and constructs a 0-1 integer programming model for TT＆C schedule problem. The model＇s constraints are relaxed respectively by three kinds of relaxation strategies（ λ,v）, and （μ,v） and （λ,u））, and three kinds of Lagrangian relaxation problems are obtained, and each relaxation problem＇s upper bound is obtained by subgradient optimization algorithm. It demonstrates validity of upper bound obtained by subgradient optimization algorithm by two scenarios, and the influences of different relaxation strategies on performance of algorithm are compared.

关 键 词：航天遥测 跟踪和指挥 调度 TT&C需求 拉格朗日松弛策略 次梯度优化 上界 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]