基于能力的武器装备体系需求生成框架研究

在界定基于能力的武器装备体系需求生成相关概念的基础上,对需求生成模式进行了总体分析,对需求生成过程按照作战任务分解描述、能力体系需求分析和装备体系需求生成进行了详细描述,初步形成了武器装备体系需求生成研究的基本框架。     

炮兵雷达阵地选择仿真系统的设计与实现*

虚拟现实技术是20世纪末发展起来的一项涉及众多学科的高新应用技术,主要针对在MultiGen Creator和Vega软件平台下开发三维仿真系统。针对目前炮兵雷达阵地选择虚拟仿真的需求,设计了炮兵雷达阵地选择仿真训练系统,介绍了仿真系统的组成及功能模块,论述了二维数字地图生成与显示、三维场景生成与显示、视景仿真的实现等关键技术,最后给出了仿真效果图。结果表明了仿真系统的可行性和实用性,极大地提高了训练效率和训练水平。     

基于Lagrange插值的非整数延时滤波器算法

针对LMS(Least Mean Square)阵列信号波束成形器延时精度低和结构复杂的缺点,提出了一种基于Lagrange插值的非整数延时滤波器算法.其本质是采用频域近似的原则,设计出一种小数延时滤波器,可以将数字信号直接延时小数倍采样周期,在精确延时专题中具有广泛用途.仿真实验表明,该滤波器可满足阵列信号波束成形中的各种延时精度要求.     

基于动态罚函数遗传算法的电磁探测卫星多星规划方法

针对电磁探测卫星的特点,考虑其主要约束条件,建立了多星联合规划数学模型,提出了基于遗传算法的电磁探测卫星多星规划算法.为处理遗传算法迭代过程中产生的不可行解,引入了基于罚函数法的约束处理方法.针对罚函数法中惩罚系数难以确定的特点,设计了惩罚系数自适应调整的动态罚函数机制.根据模拟的数据进行实验及分析,表明该方法能有效解决电磁探测卫星多星规划问题.     

Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems

Clustering problems are often difficult to solve due to nonlinear cost functions and complicating constraints. Set partitioning formulations can help overcome these challenges, but at the cost of a very large number of variables. Therefore, techniques such as delayed column generation must be used to solve these large integer programs. The underlying pricing problem can suffer from the same challenges (non‐linear cost, complicating constraints) as the original problem, however, making a mathematical programming approach intractable. Motivated by a real‐world problem in printed circuit board (PCB) manufacturing, we develop a search‐based algorithm (Rank‐Cluster‐and‐Prune) as an alternative, present computational results for the PCB problem to demonstrate the tractability of our approach, and identify a broader class of clustering problems for which this approach can be used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

A cooperative game in search theory

Search theory originates from the military research efforts of WWII. Most researchers of that period modeled their search games in noncooperative games, where players are enemies or compete against each other. In this article, we deal with a cooperative search game, where multiple searchers behave cooperatively. First we describe several search problems and discuss the possibility of a coalition or cooperation among searchers. For the cooperative search game, we define a function named quasi‐characteristic function, which gives us a criterion similar to the so‐called characteristic function in the general coalition game with transferable utility. The search operation includes a kind of randomness with respect to whether the searchers can detect a target and get the value of the target. We also propose a methodology to divide the obtained target value among members of the coalition taking account of the randomness. As a concrete problem of the cooperative search game, we take the so‐called search allocation game, where searchers distribute their searching resources to detect a target in a cooperative way and the target moves in a search space to evade the searchers. Lastly, we discuss the core of the cooperative search allocation game. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

一种基于QFD与ANP的装备作战需求分析方法

针对当前在装备论证过程中缺乏合适的方法和工具将模糊的军事需求科学合理地映射到定量的作战使用性能上去的问题,提出一种基于质量功能部署(QFD)与网络分析法(ANP)的装备作战需求分析方法.该方法能够辅助论证人员深刻理解和合理判断论证中各种因素之间的相互影响关系,通过结构化的装备作战需求分析过程得到能正确反映军事需求的作战使用性能重要度排序.通过实例验证了方法的有效性和实用性.     

磁流体动力学控制二维扩压器流场数值模拟研究

对常规扩压器进行了简介并作机理分析.用小磁雷诺数假设下基于Favre质量平均的全Navier-Stokes方程来求解外加电磁场的超声速扩压器流场.与常规扩压器比较可以发现,选用适当的外加电磁场组合可以使流动在更短的距离内实现减速扩压,并将部分动能转化为电能.研究表明:仅添加一定外磁场时,第一道激波位置、第二道激波位置、激波串长度分别为无外加电磁场情况的62.19%,77.74%和50.18%.     

一种面向多制式路径规划的网络模型

随着综合交通运输与导航应用技术的发展,综合利用多种交通方式实施路径规划的应用需求日益迫切,传统的单一制式路径规划系统与服务正在向多制式的方向发展.然而,传统的路径规划模型与算法难以直接应用在多制式的条件下.针对多制式路径规划的特点,构建合理的数据模型是解决该问题的基础.为此,提出了制式切换点的概念,并以此为基础建立了包含多制式图集合、顶点属性表和切换点矩阵三个主要部分的多制式网络模型,并在真实的城市道路网数据集上进行了多制式网络构建实验.该工作能够从理论和实践两个方面为多制式路径规划算法的设计提供基础性的技术支持.     

区域目标搜索中基于改进RRT的UAV实时航迹规划

在线自主航迹规划是无人机(Unmanned Aerial Vehicles,UAV)执行区域目标搜索任务的有效保证.针对UAV区域搜索中航迹规划的实时性要求,提出了一种固定搜索模式和动态搜索模式相结合的UAV自主航迹规划框架.在快速扩展随机树(RRT)方法的基础上,通过改进随机扩展树的节点选择和引入启发式信息,提出了基于改进RRT的UAV实时搜索航迹规划算法,该算法能够有效降低在线航迹规划的时间代价和扩展节点数.仿真实验结果验证了本文方法的有效性.