检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:代进进[1] 李相民[1] 刘培培[2] 黎子芬[1]
机构地区:[1]海军航空工程学院 [2]中国人民解放军92076部队
出 处:《电光与控制》2013年第5期15-20,24,共7页Electronics Optics & Control
基 金:国防预研基金资助项目(4010804040102)
摘 要:舰艇编队网络化反导作战条件下,目标分配问题演变为"发射节点-制导节点-目标"三者的优化匹配问题,该问题具有很强的实时性和动态随机性。将目标分配分为拦截适应性判断和优化匹配决策两个阶段。拦截适应性判断阶段给出了集成火力单元目标分配区、截止期的计算方法,进而确定了每个目标的拦截适应性判断结果;优化匹配决策阶段建立了静态"发射节点-制导节点-目标"三者的优化匹配模型,分析了动态随机性对目标分配方案的影响。最后,设计了基于遗传算法的Anytime算法求解模型,重点给出了算法的随机事件处理方法和算法的元级控制策略。仿真结果验证了方法的可行性和模型、算法的有效性。Under the condition of warship formation networked air-defense operation, the target allocation evolves into an optimization matching problem of "launch node-guide node-target", which has strongly real- time performance and dynamic randomness. In this paper, the target allocation procedure is divided into two phases: interception adaptative judging and optimization matching decision-making. In the phase of interception adaptative judging, calculating methods of allocation zone and deadlines of target are presented, and then the result of interception adaptative judging is determined. In the phase of optimization matching decision-making, static optimization matching model of "launch node-guide node-target" is established, and the influence of dynamic randomness on target allocation scheme is analyzed. Finally, an Anytime algorithm based on GA is designed to solve the model, for which the random event handling and meta-level control strategy are discussed. The feasibility of the method, and the validity of the model and algorithm are verified through simulation results
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.31