航天测控调度分枝定界算法  

Branch and bound algorithm for TT&C scheduling

作　　者：康宁[1] 武小悦[1] 

机构地区：[1]国防科学技术大学信息系统与管理学院,长沙410073

出　　处：《计算机工程与应用》2011年第31期17-19,85,共4页Computer Engineering and Applications

基　　金：国家部委项目

摘　　要：通过分析航天测控调度问题的测控需求,建立了航天测控调度整数规划模型,引入了拉格朗日松弛思想并与分枝定界算法结合,设计了基于拉格朗日松弛的分枝定界算法求解航天测控调度问题。通过对两个场景的仿真实验,得到了两个场景的航天测控调度问题最优值,验证了基于拉格朗日松弛的分枝定界算法的有效性。This paper analyzes TTC request of TTC scheduling problem and constructs an integer programming model of TTC scheduling,introduces an idea of Lagrangian relaxation and combines the idea with branch and bound algorithm,designs a branch and bound algorithm based on Lagrangian relaxation to solve TTC scheduling problem.Finally,two scenarios are tested,and obtains the optimal value of TTC scheduling problem about the two scenarios,the results demonstrate validity of the branch and bound algorithm based on Lagrangian relaxation.

关 键 词：拉格朗日松弛 航天测控调度 次梯度优化 分枝定界 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]