基于RGI的浮空器任务规划问题研究  

Research on the Mission Planning for the Aerostats Based on Random Greedy Insertion Algorithm

作　　者：汤俊[1] 祝江汉[1] 吴昊[1] 

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

出　　处：《计算机仿真》2010年第3期47-50,共4页Computer Simulation

摘　　要：侦察任务规划是浮空器军事应用中的重要问题,对于最大化满足侦察任务需求、提高浮空器资源利用率具有重要作用。针对浮空器侦察系统的任务规划问题,考虑任务需求约束、载荷约束等条件下,构建了浮空器连续侦察监视的混合整数规划模型,并采用贪婪随机插入(RGI)算法对模型进行了求解。该算法结合了贪婪算法和模拟退火算法的设计思想,既保留了一定贪婪特征又提高了跳出局部最优解的能力。最后通过一个多浮空器多目标的仿真实例验证了算法的有效性。Mission planning for the aerostats is an important application of the aerostat system. In order to maximize the utilization of the aerostats to execute more reconnaissance - tasks, the constraints of and payloads have been considered in this paper. The mix - integer - programming model has been constructed, and an effective method based on the random greedy insertion algorithm has also been put forward. The algorithm combines the ideas of greedy algorithm and simulated annealing algorithm. The RGI remains the features of greedy algorithm and increases the capability of jumping out the local solution. At last, the paper proves the validity of the algo-rithm by a simulation example with multi -aerostats and multi -targets.

关 键 词：浮空器 任务规划 混合整数规划模型 贪婪随机插入算法 

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