基于复杂网络理论的岸防作战体系骨干网络研究

随着信息技术在战争中的大量应用,现代战争越来越呈现出网络化和体系对抗性,研究其拓扑特性已十分必要。基于复杂网络理论,首先建立了岸防作战体系网络模型,然后提出一种基于贪心思想的骨干网挖掘算法,最后对模型的骨干网络进行了研究。结果表明该方法能够快速、准确地挖掘出岸防作战体系的网络骨干,并能为军事对抗体系的复杂网络应用研究提供借鉴和参考。     

基于粒子群优化的蚁群算法在战场电磁频率分配中的应用

为对战场电磁频率进行有效分配以减少用频设备间的相互干扰,提出了将一种基于粒子群优化的蚁群算法应用于频率分配的方法。首先介绍了战场频率管控流程的相关内容,并以干扰度最低为目标函数,使用基于粒子群算法优化的蚁群算法进行频率分配管理。粒子群算法优化蚁群算法中启发信息的权重及信息素挥发系数,作为粒子群位置和速度参数进行初始化,将粒子群算法生成的分配结果作为蚁群算法的初始信息素,利用蚁群算法较强的寻优能力寻找最佳分配方案。实验结果验证了该算法和模型的可行性。     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

Model parameter estimation and residual life prediction for a partially observable failing system

We consider a partially observable degrading system subject to condition monitoring and random failure. The system's condition is categorized into one of three states: a healthy state, a warning state, and a failure state. Only the failure state is observable. While the system is operational, vector data that is stochastically related to the system state is obtained through condition monitoring at regular sampling epochs. The state process evolution follows a hidden semi‐Markov model (HSMM) and Erlang distribution is used for modeling the system's sojourn time in each of its operational states. The Expectation‐maximization (EM) algorithm is applied to estimate the state and observation parameters of the HSMM. Explicit formulas for several important quantities for the system residual life estimation such as the conditional reliability function and the mean residual life are derived in terms of the posterior probability that the system is in the warning state. Numerical examples are presented to demonstrate the applicability of the estimation procedure and failure prediction method. A comparison results with hidden Markov modeling are provided to illustrate the effectiveness of the proposed model. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 190–205, 2015     

坦克火控系统机动目标的自适应滤波与自适应解命中问题

在非制导火控系统中,为实现目标信息的自适应滤波与自适应解命中问题,机动目标模型应能实时识别,并要适应工作周期的各种变化。本文提出了“参数辨识模型”,首次完全满足了上述要求。     

一种多方位一距离目标定位的最小二乘伴随估计器

对纯方位最小二乘估计器,在已知某时刻一个观测距离的情况下,导出了一种伴随型的目标速度估计器．该算法嵌入原最小二乘估计器之中,计算简单且便于工程应用．     

网络图式通用装备保障文书生成的研究

网络图式军用文书是战时通用装备保障文书中通常采用的文书形式之一,给出装备保障文书辅助生成系统的总体结构,将网络分析方法引入通用装备保障文书辅助生成系统的研究,在此基础上阐述了网络图式文书生成子系统的功能、数学模型及网络计算、网络优化的部分算法。     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于协商的Agent资源冲突消解算法研究

针对分布式规划系统中Agent计划的资源冲突问题,研究了资源冲突的分类;基于Agent协商理论,从资源最优配置的角度,论证了最优的协商策略,提出了可重复利用的不可分享型资源的冲突消解算法,较好地解决了Agent分布式规划中出现的一类资源冲突问题。算例表明,给出的冲突消解算法是有效的。     

基于方位角变化率的快速高精度无源定位方法

在分析现有单站无源定位方法优缺点的基础上,根据运动平台对固定目标无源定位技术的特点,提出了一种通过方位角变化率信息对观测站与目标间距离进行解算的快速高精度无源定位方法。并通过仿真,验证了该方法是一种高精度、快速的定位方法,具有较强的通用性。其主要应用于机载无源探测设备对地面固定雷达站或其他辐射源定位,从而为引导导弹对其攻击提供必要的数据。