| 航天TT&C调度的拉格朗日松弛策略 |
| |
| 引用本文： | 康宁,武小悦,陈杨. 航天TT&C调度的拉格朗日松弛策略[J]. 计算机工程, 2011, 37(19): 283-285. DOI: 10.3969/j.issn.1000-3428.2011.19.093 |
| |
| 作者姓名： | 康宁 武小悦 陈杨 |
| |
| 作者单位： | 1. 国防科学技术大学信息系统与管理学院,长沙,410073
2. 北京跟踪与通信技术研究所,北京,100094 |
| |
| 摘 要： | 根据航天遥测、跟踪和指挥(TT&C)调度的测控需求，建立航天测控调度问题的0-1整数规划模型，运用 、 和 3种策略对模型中的约束进行松弛，通过次梯度优化算法求得每种松弛问题的上界。利用2个场景验证上界(目标函数值)的有效性，调度结果表明，3种松弛策略中以次梯度优化算法得到的上界差别最小。
|
| 关 键 词： | 航天遥测 跟踪和指挥 调度 TT&C需求 拉格朗日松弛策略 次梯度优化 上界 |
| 收稿时间： | 2011-04-21 |
Lagrangian Relaxation Strategy for Aerospace TT&C Schedule |
| |
| KANG Ning,WU Xiao-yue,CHEN Yang. Lagrangian Relaxation Strategy for Aerospace TT&C Schedule[J]. Computer Engineering, 2011, 37(19): 283-285. DOI: 10.3969/j.issn.1000-3428.2011.19.093 |
| |
| Authors: | KANG Ning WU Xiao-yue CHEN Yang |
| |
| Affiliation: | 1.College of Information System and Management,National University of Defense Technology,Changsha 410073,China;2.Beijing Institute of Tracking and Telecommunications Technology,Beijing 100094,China) |
| |
| 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 （λ,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. |
| |
| Keywords: | aerospace Telemetry, Track and Command（TT＆C） schedule TT＆C requirement Lagrangian relaxation strategy subgradientoptimization upper bound |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
|
