基于区间数TOPSIS法优选空军战役作战计划

针对战役作战计划优选中的不确定性,运用区间分析和TOPSIS(Technique for Order Preference by Similarity to Ideal Solution)法探索空军战役作战计划优选问题.通过引进区间数乘法运算,将区间数多指标决策问题转变为指标为区间数的多指标决策问题,进而给出区间数多指标决策问题的TOPSIS法,对空军战役作战计划进行排序选优.与传统方法相比较,该方法较好地解决了评价指标为不确定值时的多指标决策问题.     

基于UML的兵力机动辅助决策软件设计

首先简要介绍了UML的建模体系,然后在使用UML对兵力机动辅助决策软件进行功能需求分析的基础上,进行了问题领域分析,建立了软件的静态和动态模型,并将该软件系统的各种要素、事件和活动,分别在时间和空间上进行了描述,方便开发人员之间的交流,为系统的分析、设计、维护及扩展提供了有利的支持,为兵力机动辅助决策软件系统的研制奠定了基础.     

作战指挥流程建模研究

近年来,国内外学者在作战指挥流程建模、评估等方面做了大量工作,取得了很多重要成果,但是缺乏对该领域研究现状的归纳与总结。从作战指挥流程的基本概念入手,通过概括当前学术界对指挥流程的3种基本认识,指明了作战指挥流程研究的范畴;归纳了4种常见的指挥流程建模方法及最新研究进展,对建模方法的特点进行总结;梳理了指挥流程效能评估的常见方法,并给出相关参考文献,概述其研究成果;结合作战指挥流程建模方法,简单介绍了3种常用的建模工具;为开展作战指挥流程建模研究提供有益的借鉴与参考。     

混合多属性决策投影算法的装甲分队目标价值评估

科学评价混合多属性目标价值是装甲分队作战决策的基础,为提高信息化装甲分队作战辅助决策水平,建立了混合多属性评估矩阵并运用投影算法完成目标价值评估与排序。实例分析表明,基于混合多属性决策投影算法可合理有效地评估多目标价值,为分队指挥员科学决策提供重要数据支持。     

基于可视化交互的国动指挥所设计

国防动员的指挥控制中大量的信息数据(如部队需求、地方资源)和错综复杂的多方关系,使得指挥员难以在短时间内从浩如烟海的信息中提取有用的决策信息和作出快速准确地指挥协调。为此,着眼未来指挥所的发展趋势,提出基于可视化交互的国动指挥所设计方法:通过分析国动指挥任务的关键路径,提取重要的决策信息,利用可视化交互技术,实现对国动任务的信息化指挥控制。以某部演习的国防动员指挥为例,验证了方法的可行性和有效性。     

准则权重信息不完全的证据推理多属性决策算法

针对准则权重信息不完全情况下的多属性决策问题,提出了一种新的证据推理多属性决策算法,它通过建立基于证据信息熵的决策模型来求解准则的最优权重系数,利用求解得到的权重系数和递归ER算法求出各方案的效用值,进而得到各方案的优劣次序。最后,通过算例分析验证了该方法的有效性和合理性。     

针对无人机集群对抗的规则与智能耦合约束训练方法

基于无人机集群智能攻防对抗构想,建立了无人机集群智能攻防对抗仿真环境。针对传统强化学习算法中难以通过奖励信号精准控制对抗过程中无人机的速度和攻击角度等问题,提出一种规则与智能耦合约束训练的多智能体深度确定性策略梯度(rule and intelligence coupling constrained multi-agent deep deterministic policy gradient, RIC-MADDPG)算法,该算法采用规则对强化学习中无人机的动作进行约束。实验结果显示,基于RIC-MADDPG方法训练的无人机集群对抗模型能使得红方无人机集群在对抗中的胜率从53%提高至79%,表明采用“智能体训练—发现问题—编写规则—再次智能体训练—再次发现问题—再次编写规则”的方式对优化智能体对抗策略是有效的。研究结果对建立无人机集群智能攻防策略训练体系、开展规则与智能相耦合的集群战法研究具有一定参考意义。     

单兵信息系统协同作战技术研究

协同作战是提高体系作战能力,发挥整体作战效能的关键,针对单兵班组在未来信息化条件下单兵作战单元协同作战的协同模式、协同流程、协同策略,协同指挥、协同作战效能评估等方面进行阐释,对未来单兵信息系统班组协同作战技术研究具有一定的指导意义。     

Many‐server loss models with non‐poisson time‐varying arrivals

This article proposes an approximation for the blocking probability in a many‐server loss model with a non‐Poisson time‐varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time‐varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing change, we randomize the time of each staffing change about the planned time. We apply simulation to show that (i) the blocking probabilities cannot be stabilized without some form of randomization, (ii) the new staffing algorithm with randomiation can stabilize blocking probabilities at target levels and (iii) the required staffing can be quite different when the Poisson assumption is dropped. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 177–202, 2017     

Scheduling combat logistics force replenishments at sea for the US Navy

The Replenishment at Sea Planner (RASP) is saving the U.S. Navy millions of dollars a year by reducing fuel consumption of its Combat Logistics Force (CLF). CLF shuttle supply ships deploy from ports to rendezvous with underway U.S. combatants and those of coalition partners. The overwhelming commodity transferred is fuel, ship‐to‐ship by hoses, while other important packaged goods and spare parts are high‐lined, or helicoptered between ships. The U.S. Navy is organized in large areas of responsibility called numbered fleets, and within each of these a scheduler must promulgate a daily forecast of CLF shuttle operations. The operational planning horizon extends out several weeks, or as far into the future as we can forecast demand. We solve RASP with integer linear optimization and a purpose‐built heuristic. RASP plans Replenishment‐at‐Sea (RAS) events with 4‐hour (Navy watch) time fidelity. For five years, RASP has served two purposes: (1) it helps schedulers generate a daily schedule and animates it using Google Earth, and (2) it automates reports command‐to‐ship messages that are essential to keep this complex logistics system operating.