装备保障信息资源规划框架设计

分析了我军装备保障信息资源的现状,找出了信息资源建设中存在的主要问题。针对我军装备保障实际,依据信息资源规划理论,提出了装备保障信息资源规划的总体方案框架及工程化方法。旨在为装备保障信息系统的开发打下基础,以促进装备保障信息化建设的进程。     

基于种群多样性测度的PSO算法及其应用研究

针对基本粒子群算法(particle swarm optimization,PSO)易局部收敛的缺陷,设计了一种根据种群多样性测度动态调整惯性权重的改进粒子群算法,通过仿真测试函数与基本粒子群算法、自适应粒子群算法(adaptive particle swarm optimization,APSO)、带收缩因子的粒子群算法(contractive particle swarm optimization,CPSO)进行比较,改进的PSO算法在提高算法的综合搜索能力方面具有优越性。将改进的PSO算法运用到作战飞行器航迹规划中,并进行了仿真实验,仿真结果验证了改进算法的有效性。     

水面舰艇编队空中威胁扇面角预测模型

针对水面舰艇编队空中威胁扇面角的预测问题,分析了影响空中威胁扇面角大小的主要因素。以具有航路规划能力的远程反舰导弹为对象,从航空兵及远程反舰导弹的作战使用特点和装备性能限制着手,建立了计算威胁扇面角的数学模型。通过仿真分析,得出了主要参数对威胁扇面角的影响规律,为水面舰艇编队对空防御兵力的配置提供了依据。     

基于RNN汉语语言模型自适应算法研究

深度学习在自然语言处理中的应用越来越广泛。相比于传统的n-gram统计语言模型,循环神经网络(Recurrent Neural Network,RNN)建模技术在语言模型建模方面表现出了极大的优越性,逐渐在语音识别、机器翻译等领域中得到应用。然而,目前RNN语言模型的训练大多是离线的,对于不同的语音识别任务,训练语料与识别任务之间存在着语言差异,使语音识别系统的识别率受到影响。在采用RNN建模技术训练汉语语言模型的同时,提出一种在线RNN模型自适应(self-adaption)算法,将语音信号初步识别结果作为语料继续训练模型,使自适应后的RNN模型与识别任务之间获得最大程度的匹配。实验结果表明:自适应模型有效地减少了语言模型与识别任务之间的语言差异,对汉语词混淆网络进行重打分后,系统识别率得到进一步提升,并在实际汉语语音识别系统中得到了验证。     

机载反辐射导弹和常规反舰导弹协同规划算法

机载反辐射导弹在攻击移动目标时容易受雷达关机影响而丢失目标,和常规主动雷达制导的反舰导弹协同攻击可以有效对抗目标雷达关机。为了达到协同作战目的,载机起飞前已知目标信息情况下,通过计划协同算法确定协同作战方案,方案包括载机和导弹各个航路点位置和到达该位置的时间点,然后按照在机场起飞前就制定好的方案实施具体作战行动。对计划协同算法进行了实例仿真,结果表明算法切实有效。     

基于Dubins路径的智能车辆路径规划算法

路径规划是车辆智能化的核心问题之一,而所有路径均可分解为简单的Dubins路径。在Dubins路径的思想下对智能车辆的行驶路径进行分段研究,并利用经典PID控制对该算法的执行性能进行检验。研究表明:算法能计算出车辆行驶的最短路径,减少了车辆行驶的路径长度,缩短了行驶时间,减少了控制系统的计算量,提高了车辆执行系统的执行力度,降低了执行误差,对最优路径具有较好的选择性。     

基于多目标优化的任务计划建模及方法

针对任务计划在进行多目标优化时采用进化算法求解效率较低的问题,设计了一种结合分组策略的非支配排序遗传(NSGA-Ⅱ)算法,可以快速有效地得到合理的分组结果。基于分组结果,调整NSGA-Ⅱ算法的步骤,灵活地进行种群初始化,使最终分配结果各优化的目标有了明显的改善,提高了算法的效率。通过实验分析,验证了所提方法的可行性和有效性。     

隐身飞机突防建模及低可探测性轨迹规划

针对隐身飞机突防飞行规划,分析了隐身飞机对警戒雷达网突防过程问题特性,建立了雷达探测模型与组网警戒雷达信息融合模型;综合考虑隐身飞机的隐身能力、预警时间和燃料消耗将隐身飞机低可探测性轨迹规划问题形式化为一个复杂多目标非线性连续时间最优控制问题;并提出基于伪谱法的低可探测性轨迹规划方法。仿真实验实现了在组网警戒雷达下隐身飞机的低可探测性突防轨迹规划,证明了方法的可用性和有效性。     

Making defense planning meaningful: the evolution of strategic guidance in the Hungarian Ministry of Defense

Hungary, a former communist state, adapted a Western-style defense planning system during the 1990s and 2000s. Although on the surface the elements of this planning system were similar to the planning programming budgeting system (PPBS) developed by the US Department of Defense, strategic guidance for defense planning has not been properly developed until recently. Thus, albeit PPBS-based defense plans were developed in the Hungarian Ministry of Defense (Hungarian MoD) regularly, they lacked both an expression of clear priorities and strategic focus. This article delineates the evolution of strategic guidance in the Hungarian MoD concentrating on current developments, and introduces the newly elaborated analytical concepts and tools, which helped to create needed strategic guidance in Hungary.     

Expansion planning for waste‐to‐energy systems using waste forecast prediction sets

We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016