计算机工程2011，Vol.37Issue(19)：283-285,3.DOI:10.3969/j.issn.1000-3428.2011.19.093
航天TT&C调度的拉格朗日松弛策略
Lagrangian Relaxation Strategy for Aerospace TT&C Schedule
康宁 1武小悦 1陈杨2
作者信息
- 1. 国防科学技术大学信息系统与管理学院,长沙410073
- 2. 北京跟踪与通信技术研究所,北京100094
- 折叠
摘要
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( (λ,v), and (μ, v) 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.关键词
航天遥测、跟踪和指挥/调度/TT&c需求/拉格朗日松弛策略/次梯度优化/上界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,3.
