作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (19): 283-285. doi: 10.3969/j.issn.1000-3428.2011.19.093

• 开发研究与设计技术 • 上一篇    下一篇

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

康 宁1,武小悦1,陈 杨2   

  1. (1. 国防科学技术大学信息系统与管理学院,长沙 410073;2. 北京跟踪与通信技术研究所,北京 100094)
  • 收稿日期:2011-04-21 出版日期:2011-10-05 发布日期:2011-10-05
  • 作者简介:康 宁(1979-),男,博士研究生,主研方向:航天测控调度模型;武小悦,教授、博士生导师;陈 杨,工程师

Lagrangian Relaxation Strategy for Aerospace TT&C Schedule

KANG Ning 1, WU Xiao-yue 1, CHEN Yang 2   

  1. (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)
  • Received:2011-04-21 Online:2011-10-05 Published:2011-10-05

摘要: 根据航天遥测、跟踪和指挥(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

中图分类号: