基于不确定性任务的多星调度启发式算法  

Heuristic Algorithm Based on Uncertain Task of Multi-satellite Scheduling

作　　者：党群[1] 欧阳诚苏[1] 黄永宣[1] 

机构地区：[1]西安交通大学系统工程研究所,西安710049

出　　处：《弹箭与制导学报》2010年第1期210-212,共3页Journal of Projectiles,Rockets,Missiles and Guidance

摘　　要：根据多星测控中用户提出的不确定性任务的特点,建立多星调度基于不确定性任务的数学模型。提出任务支持时间最大化作为启发式准则,以及弧段分割法调整测控资源冲突。在此基础上,结合资源均衡原则和卫星优先级策略,提出了基于不确定性任务的多星调度启发式算法。最后,算法运用在10星6站的调度问题中,仿真结果表明算法是可行的。According to the characteristics of the uncertain task of the multi-satellite scheduling problem, the mathematic model was established for uncertain task scheduling problem. Maximization of the sum of the time-window segments visibly was defined as one of the heuristic criteria for searching the one-satellite ＆ multi-station scheduling problem. The segment cutting method was proposed to adjust station resource conflict. Based on the mentioned above, combined with recourse balanced principle, the heuristic algorithm was proposed for uncertain tasks scheduling problem. At last, the algorithm was simulated in the scheduling problem of 10 satellites ＆6 stations. The result shows that the algorithm is feasible.

关 键 词：多星调度 资源冲突 启发式算法 弧段分割法 

分 类 号：V474.2[航空宇航科学与技术—飞行器设计]