| 摘要: |
| 针对航天测控资源配置优化问题这类约束条件繁杂且数量众多的组合优化问题，提出了可用于资源动态预留的航天测控资源配置优化算法。具体来讲，考虑测控设备和航天器执行任务的唯一性约束以及时间窗口冲突约束，建立了基于原子型任务调度的0-1整数规划模型；设计了能将实际需求和求解算法进行解耦的求解框架，并基于最大化利用测控资源的思想获得了可回溯的并行最佳优先搜索算法。仿真结果表明，所提算法达到了能在国内东部、西部、南部和北部四大测控区域中更加均衡地动态预留出更多、更重要测控设备的资源配置优化效果。 |
| 关键词: 航天测控；资源动态预留；资源配置优化 并行最佳优先搜索 |
| DOI： |
|
| 基金项目: |
|
| An optimization algorithm of space TT&C resource allocation for dynamic resource reservation |
| LIANG Jun,CHEN Xuejun,LIU Jianping,YUAN Dongyang,LUO Qingqing |
| (Xi’an Satellite Control Center,Xi’an 710043,China) |
| Abstract: |
| For the optimization problem of resource allocation of space telemetry,tracking and control(TT&C),which belongs to the combinatorial optimization problem with multifarious and numerous constraints,an optimization algorithm of space TT&C resource allocation for dynamic resource reservation is presented.Specifically,considering the uniqueness constraints for equipment and spacecraft to perform tasks and the time window conflict constraints,a 0-1 integer programming model based on atomic task scheduling is established,and a solution framework that can decouple the engineering requirements from the solution algorithms is designed.According to the idea of maximizing the utilization of resource of space TT&C,a traceable parallel best-first search algorithm is obtained.The simulation results show that the proposed algorithm achieves the expected optimization effect of reserving more and more important resource of space TT&C equipment evenly in the four regions of the East,West,South and North of China. |
| Key words: space TT&C;dynamic resource reservation optimization of resource allocation parallel best-first search |
