可修系统的一个模型

本文研究一种具有4种故障形式的可修系统。利用向量Markov过程方法,求出了系统的可靠性指标。     

基于假设检验的编队组织决策设计

从集中式和分散式组织结构分析出发,采用假设检验的方法,探讨了分布式结构假设检验在海军舰艇编队环境评估中的组织决策设计,并从决策设计和算法上对其进行了复杂性分析.研究结果表明,基于假设检验的组织决策是一个NP问题,就存在的问题提出算法和组织设计研究的思路.     

Application of Markov renewal theory and semi-Markov decision processes in maintenance modeling and optimization of multi-unit systems

In this paper, a condition-based maintenance model for a multi-unit production system is proposed and analyzed using Markov renewal theory. The units of the system are subject to gradual deterioration, and the gradual deterioration process of each unit is described by a three-state continuous time homogeneous Markov chain with two working states and a failure state. The production rate of the system is influenced by the deterioration process and the demand is constant. The states of the units are observable through regular inspections and the decision to perform maintenance depends on the number of units in each state. The objective is to obtain the steady-state characteristics and the formula for the long-run average cost for the controlled system. The optimal policy is obtained using a dynamic programming algorithm. The result is validated using a semi-Markov decision process formulation and the policy iteration algorithm. Moreover, an analytical expression is obtained for the calculation of the mean time to initiate maintenance using the first passage time theory.     

One Minute in Haditha: Ethics and Non-Conscious Decision-Making

In November 2005, U.S. Marine Sergeant Frank Wuterich fired on and killed five unarmed Iraqi men standing by a car near the site of an improvised explosive device explosion (IED) in Haditha, Iraq. Moments earlier, the IED had destroyed a vehicle in the convoy that Wuterich led, killing one of the men in it. This article argues that analyzing Wuterich's conduct as a rapid non-conscious response captured by the model of Recognition-Primed Decision-Making (RPD) allows us to reconstruct his implicit decision-making in ways that provide insight into psychological processes that may operate during combat. Emerging research in neuroscience suggests that RPD in situations with moral significance involves a complex neural computational process in which emotion plays a powerful role. This article maintains that incorporating these insights can provide greater understanding of the moral psychology of behavior in combat, and may help guide military-ethics training for asymmetric conflicts that pose difficult significant challenges in distinguishing combatants from civilians.     

UCAV编队对地攻击智能决策系统总体结构

UCAV编队对地攻击是未来战争制信息权和制空权的关键所在,结合无人作战飞机(UCAV)与有人驾驶飞机各自的特点和优势,提出了UCAV编队对地攻击系统的基本组成和对地攻击流程.根据UCAV编队对地攻击的战术决策类型和决策方式,构造了UCAV编队对地攻击智能决策系统的总体结构并且提出了决策系统应该解决的关键技术,详细分析了所建立的UCAV编队对地攻击决策系统的决策方式和决策流程,并且对该系统所涉及的关键技术进行了详细的研究.     

多轮次打击情况下的跑道失效率计算

对机场跑道进行多轮次打击时,每轮打击之后对跑道失效率的计算可掌握是否达到预期打击目的,为下一轮打击提供决策依据.以马尔科夫链为理论依据对多轮次打击情况下的跑道失效率进行计算,只需计算出跑道失效率的一步转移概率矩阵,即可求出任意多次打击后跑道的失效率,避免了采用常规方法时的多层迭代计算,降低了多次打击计算的难度.实例证明,该方法具有运算速度快、精度高的特点,可用于多轮次打击情况下的跑道失效率计算问题.     

运动目标轨迹分类与识别

运动目标轨迹识别是运动分析中的基本问题,其目的是解释所监视场景中发生的事件,对所监视场景中运动目标轨迹的行为模式进行分析与识别,智能地做出自动分类.对轨迹有效性判断后采用K均值聚类,引入改进的隐马尔可夫模型算法,针对轨迹的复杂程度对各个轨迹模式类建立相应的隐马尔可夫模型,利用训练样本训练模型得到可靠的模型参数,计算测试样本对于各个模型的最大似然概率,选取最大概率值对应的轨迹模式类作为轨迹识别的结果,对两种场景中聚类后的轨迹进行训练与识别,平均识别率较高,实验结果表明该方法是有效的.     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于信息-决策影响因素的兰彻斯特作战模型?

为有效评估信息因素和决策因素对现代作战进程的影响,改进了传统的兰彻斯特方程作战模型,通过引入信息获取能力指数和筹划决策能力指数,建立了基于信息-决策影响因素的兰彻斯特作战模型,并分3种假设情况进行了仿真。仿真结果表明,该作战模型一定程度上反映了信息因素和决策因素对作战的影响,体现了现代作战的基本致胜机理。     

基于GIOWA算子的坦克分队火力配系方案决策

针对决策过程中评估属性值以语言信息来描述的情况,提出了一种基于GIOWA算子的坦克分队火力配系方案决策方法,并详细给出了该方法的计算步骤和算法。研究表明,该方法能够使得决策者在决策过程中简单、直接地表达自己的想法,同时可以不去确定评估属性的权重,使得决策结果更为客观合理,最后通过一个示例来验证方法的可行性和有效性。