摘要: 根据航天遥测、跟踪和指挥(TT&C)调度的测控需求,建立航天测控调度问题的0-1整数规划模型,运用 、 和 3种策略对模型中的约束进行松弛,通过次梯度优化算法求得每种松弛问题的上界。利用2个场景验证上界(目标函数值)的有效性,调度结果表明,3种松弛策略中以次梯度优化算法得到的上界差别最小。
关键词:
航天遥测,
跟踪和指挥,
调度,
TT&C需求,
拉格朗日松弛策略,
次梯度优化,
上界
Abstract: 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( , and and ), 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.
Key words:
aerospace Telemetry,
Track and Command(TT&C),
schedule,
TT&C requirement,
Lagrangian relaxation strategy,
subgradient optimization,
upper bound
中图分类号:
康宁, 武小悦, 陈杨. 航天TT&C调度的拉格朗日松弛策略[J]. 计算机工程, 2011, 37(19): 283-285.
KANG Ning, WU Xiao-Yue, CHEN Yang. Lagrangian Relaxation Strategy for Aerospace TT&C Schedule[J]. Computer Engineering, 2011, 37(19): 283-285.