Replacing nonidentical vital components to extend system life

We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

被掩护地面固定目标不受空中打击分析

重点分析了被掩护地面固定目标不受空中打击的相关因素,并定量地分析了敌空袭兵器攻击地面被掩护目标时所需的数量,从而为地面防空建立最佳的防空部署提供依据。因为防空兵群对空袭兵器的射击次数与防空兵群的杀伤区面积成线性关系,所以在探讨如何部署防空兵力时,以防空兵群的杀伤区面积为准则来建立线性规划模型。     

A parallel machine replacement model

This paper considers a finite horizon parallel machine replacement problem where a fixed number of machines is in operation at all times. The operating cost for a machine goes up as the machine gets older. An older machine may have to be replaced by a new one when its operating cost becomes too high. There is a fixed order cost associated with the purchase of new machines. Machine purchase prices and salvage values may depend on the period in which they were purchased. The objective is to find a replacement plan that minimizes the total discounted cost over the problem horizon. We believe that the costs in our model are more commonly observed in practice than those previously used in the literature. The paper develops properties of optimal solutions and an efficient forward‐time algorithm to find an optimal replacement plan. A dominance property is developed that further limits the options to be considered, and a simple forecast horizon result is also presented. Future research possibilities are mentioned. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 275–287, 2002; Published online in Wiley InterScience (http://www.interscience.wiley.com). DOI 10.1002/nav.10012     

基于CGF的水面舰艇编队模型仿真

计算机生成兵力(CGF)技术在水面舰艇编队智能化生成和仿真方面有着十分广阔的应用前景.从水面舰艇编队CGF物理模型人手,研究了水面舰艇单舰及战斗编队、舰载直升机和潜艇等兵力的仿真,实现了CGF兵力在执行各种作战任务过程中的所有战术动作仿真,重点研究了水面舰艇编队的攻击、防御智能决策和软硬武器的智能化仿真,包括导弹、鱼雷、深弹、电子对抗和水声对抗器材等.通过在舰艇作战仿真训练系统的应用,表明CGF对提高水面舰艇编队兵力生成和仿真的智能化程度是非常有效的.     

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

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

某型小口径高炮动态跟踪系统误差分析

在该型小口径高炮系统的指标中,对于高炮动态射击精度、火控跟踪精度和随动系统精度都是既有随机误差要求,又有系统误差要求.将火控动态跟踪系统误差作为非常重要的考核指标,却与外场测试结果有差别.从动态跟踪系统误差的产生、分类和内涵出发,通过建立动态跟踪数学模型,并结合作图对其原由进行了深刻的分析.     

基于Petri网的近程防空武器射击建模

提出一种扩展时延Petri网,新提出的Petri网与以往高级时延Petri网的不同之处在于它允许个体的个性与共性同样得到考虑。这种方法被用来对装备多跟踪装置、多种对空武器的防空系统对多目标进行射击过程进行建模、分析、模型的正确性在文章最后的仿真中得到了验证。     

反无人机绳网捕获系统的动力学建模与仿真

针对无人机"黑飞"问题,提出了包含捕获平台地面发射、柔性绳网空中展开抓捕和降落伞回收的反无人机绳网捕获系统方案,建立了全过程动力学模型.并将动力学模型中的平台飞行轨迹模型和绳网展开模型与飞行试验数据进行了对比验证.结果表明,该系统动力学建模与仿真方案可行,对系统工程设计具有指导意义.     

具有吞吐量和时延约束的软件无线电波形部署决策算法

针对当前具有吞吐量和时延约束的软件无线电波形部署决策算法在内存开销方面考虑的不足,提出一个更为通用的波形部署决策系统模型,将波形的处理开销、内存开销和通信带宽开销都纳入到波形部署决策过程中,并设计了一种基于动态规划的波形部署决策算法以最小化波形对平台各种计算资源的占用总和。仿真结果表明,内存对波形部署决策具有重要影响,与未考虑内存开销的解决方案相比,平台支持的平均最大波形数目和平均处理资源利用率均下降40%左右。     

A decomposition heuristic for the twin robots scheduling problem

This article provides an efficient heuristic based on decomposition for the twin robots scheduling problem (TRSP). TRSP concerns two moving robots executing storage and retrieval requests in parallel along a shared pathway. The depots are located at both ends of the line and a dedicated robot is assigned to each of them. While moving goods between their respective depots and some storage locations on the line, noncrossing constraints among robots need to be considered. Our heuristic uses a dynamic programming framework to determine the schedule of one robot while keeping the other one's fixed. It finds near‐optimal solutions even for large problem instances with hundreds of jobs in a short time span. © 2014 Wiley Periodicals, Inc. 62:16–22, 2015