Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

遗传算法及其在导弹火力分配上的应用

遗传算法是一种近年来新发展起来的优化算法,目前它已被广泛应用于解决许多实际问题,如函数优化、图像识别、机器学习、人工神经网络、人工生命、优化调度等许多领域。通过对一种遗传算法的研究,阐述其在导弹武器火力分配上的应用。首先设计和实现了一种遗传算法;然后描述了导弹火力分配优化问题,建立了其数学模型;最后运用遗传算法求解了该问题。     

坦克分队在进攻战斗中的最佳火力分配

运用兰切斯特方程和极值理论就坦克分队在进攻战斗中如何分配火力及使火力分配最佳进行了研究。给出了最佳方案的计算方法     

改进分块局部最佳维纳滤波算法的干涉相位滤波

针对合成孔径雷达干涉相位滤波问题,提出了一种改进的分块局部最佳维纳滤波算法。该算法是加性高斯白噪声下的线性最小均方误差估计,利用目前图像滤波最前沿的技术——非局部技术,来联合估计图像的一、二阶矩。针对干涉相位中噪声的空变性,在应用中提出了两点改进:估计噪声的标准差时,用均值代替中值;根据噪声标准差的最大值和均值的比值,自适应地确定类的数量。仿真和实测数据表明,改进后的分块局部最佳维纳滤波算法是有效的,并优于其他三种算法。     

Bi‐objective missile rescheduling for a naval task group with dynamic disruptions

This paper considers the rescheduling of surface‐to‐air missiles (SAMs) for a naval task group (TG), where a set of SAMs have already been scheduled to intercept a set of anti‐ship missiles (ASMs). In missile defense, the initial engagement schedule is developed according to the initial state of the defensive and attacking units. However, unforeseen events may arise during the engagement, creating a dynamic environment to be handled, and making the initial schedule infeasible or inefficient. In this study, the initial engagement schedule of a TG is assumed to be disrupted by the occurrence of a destroyed ASM, the breakdown of a SAM system, or an incoming new target ASM. To produce an updated schedule, a new biobjective mathematical model is formulated that maximizes the no‐leaker probability value for the TG and minimizes the total deviation from the initial schedule. With the problem shown to be NP‐hard, some special cases are presented that can be solved in polynomial time. We solve small size problems by the augmented ? ‐ constraint method and propose heuristic procedures to generate a set of nondominated solutions for larger problems. The results are presented for different size problems and the total effectiveness of the model is evaluated.     

高超声速滑翔飞行器滑翔段初始状态的唯一性和最优性分析

临近空间高超声速滑翔飞行器的弹道特性主要受滑翔段初始状态和飞行器控制律影响。在飞行器控制律确定的情况下,研究了滑翔段初始状态对高超声速滑翔飞行器弹道特性的影响规律。按照滑翔弹道的不同形式,在纵向平衡滑翔条件下,通过理论推导得出飞行器状态变量的解析式,结合平衡滑翔条件分析平衡滑翔弹道滑翔段初始状态的唯一性;在纵向跳跃滑翔条件下,构建弹道性能评价指标,利用群智能算法,寻找弹道性能最优时的滑翔段初始状态。利用单因素敏感性分析方法,分别对两种滑翔弹道的滑翔段初始状态进行敏感性分析,初始状态中初始速度对弹道特性的影响最大。对高超声速滑翔飞行器初始状态唯一性与最优性的分析,可为高超声速滑翔飞行器的弹道设计、弹道跟踪、轨迹预测和轨迹优化提供借鉴。     

基于经济绩效的国防工业市场最优集中度研究

以满足企业利润最大化和社会福利最大化双重效率标准的思想为基础,通过拟合我国国防支出需求函数和国防工业企业的成本函数,对我国国防工业市场最优集中度进行了理论研究,得出最优企业数量的一般表达式,并以我国航空工业上市公司为例,对其市场集中度展开了系统性估算。研究结果表明,我国国防工业产业的最优企业数量可以根据相关数据与拟合出的参数得到一个明确的数值,并且我国国防工业产业的最优市场集中度表现为适度集中,而在特殊情况下表现为完全集中。我国航空工业上市公司的最优企业数量为14家时,能够满足企业利润最大化与市场出清的双重标准,市场集中度达到最优。     

SpaceWire网络热点通信模式的缓存资源分配算法

基于SpaceWire网络在热点通信模式下的工作特点,研究缓存资源的分配算法。给出均匀通信模式和热点通信模式的释义;推导网络路由节点的满负荷概率和平均延时的解析方法,计算网络中的关键通信节点;再给出SpaceWire网络缓存资源分配算法。利用Opnet网络仿真平台建立SpaceWire通信模型,仿真了不同通信模式中采用缓存优化策略前后的关键性能指标。研究结果表明:在热点通信模式状态下,该缓存资源分配算法在保证总资源一定的前提下,网络系统的平均延时降低,优化了SpaceWire网络性能。     

Mixed rules in multi‐issue allocation situations

Multi‐issue allocation situations study problems where an estate must be divided among a group of agents. The claim of each agent is a vector specifying the amount claimed by each agent on each issue. We present a two‐stage rule. First, we divide the estate among the issues following the constrained equal awards rule. Second, the amount assigned to each issue is divided among the agents in proportion to their demands on this issue. We apply the rule to two real‐world problems: the distribution of natural resources between countries and the distribution of budget for education and research between universities.     

运动视觉平台点目标定位误差分析和平台最优运动轨迹设计

对运动视觉平台点目标定位问题进行了研究,介绍了基于视觉共线方程的目标定位方法,分析了共线方程关于视线约束的实质。在观测视线相关坐标系推导了视线方向角矢量对目标定位误差的影响规律,分析了多观测对定位误差的影响,并基于最小化目标定位误差推导了视觉平台的最优运动轨迹,利用简单明了的分析方法得到了与已有文献优化Fisher信息矩阵方法一致的结论。利用仿真和试验对定位误差和最优轨迹进行了验证,证实了定位误差理论分析和最优运动轨迹设计的正确性。