军区营房管理辅助决策信息系统设计研究

为满足现代战争对后勤保障提出的新要求,改革传统的营房保障模式,根据信息系统、数据库及网络建设的理论,通过对军区营房管理部门组织结构、工作流程、业务内容、部门权限的分析,提出了军区营房管理辅助决策信息系统设计的要求、系统的配置、系统主要模块划分等内容,为系统的进一步开发搭建了框架。     

多人多任务动态决策建模的环境

就人的组队如何解决多任务环境中具有不定性情况下分布式资源管理等问题 ,在微机上采用具有音响—图形功能的 Turbo pascal程序语言 ,建立了一个可以控制的实验环境 ,经分析得出 :在此环境中 ,可以模拟、产生 C3分布系统方面基本的决策制作问题 ,且能充分适应于复杂性的逐步引入 ,可用作建立多人多任务动态决策模型的载体 ,开发组队决策的规范—描述理论。     

器材保障DSS中面向对象的模型库系统

主要论述了装甲器材保障决策支持系统中的面向对象的模型表示方法和模型库系统设计,并介绍了模型库系统设计中的关键问题模型规范、模型建立、模型控制和模型监控等.     

空间应急飞行器姿态快速机动控制研究

以空间应急飞行器姿态机动快速控制过程为研究对象,对姿态快速解耦控制问题进行研究.采用决策树理论对时间最优控制和倾斜开关曲线控制这两种控制策略进行综合,以控制时间作为代价函数,获得三通道时间最优控制策略.与其他方法相比,本控制策略控制时间大幅缩短,控制精度满足设计需求.另外对控制器不同控制周期下的控制效果进行仿真比较,对控制器控制周期选择具有指导意义.     

The LP/POMDP marriage: Optimization with imperfect information

A new technique for solving large‐scale allocation problems with partially observable states and constrained action and observation resources is introduced. The technique uses a master linear program (LP) to determine allocations among a set of control policies, and uses partially observable Markov decision processes (POMDPs) to determine improving policies using dual prices from the master LP. An application is made to a military problem where aircraft attack targets in a sequence of stages, with information acquired in one stage being used to plan attacks in the next. © 2000 John Wiley & Sons, Inc., Naval Research Logistics 47: 607–619, 2000     

基于Petri网的防空群决策信息传输能力分析

决策信息传输能力的大小,直接决定着防空作战行动的作战效能,进而决定了防空作战的成败。针对防空群决策信息传输问题,用Petri网建模,从时效性和可靠性两个方面,对防空群的决策信息传输能力进行了分析,得到了不同指挥方式下的信息传输能力的度量。对防空群通信能力的分析和指挥体制的优化有一定的借鉴和指导意义。     

军事地理信息系统数据组织与显示实现及应用

在信息作战条件下,军事地理信息系统(MGIS)作为作战指挥自动化、数字化战场、辅助军事决策和现代武器系统的战场地理环境平台倍受世界各国的重视.在讨论军事地理系统的数据模型和数据结构的基础上,研究了军事地理信息系统的数据组织方法,针对数据存储结构设计进行了详细的论述,提出了一系列数据结构样本及数据系统设计方案,并通过软件开发实例,验证了其具体实现方法和途径.地图数据模型规划以Coverage模型为基础,在数据处理过程中以Geodatabase对象操作为原型,综合两者的优势,提高了海图的显示速度,并在实际工程中得到了很好的应用.     

基于多属性目标决策的威胁评估排序模型

针对当前海战中对舰艇编队构成威胁的空中目标的特点,运用目标多属性理论探索对空中目标的威胁排序问题.提出了一种对空中目标进行威胁评估和排序的方法,并通过示例介绍了威胁评估和排序的求解过程.该方法有效地解决了目标威胁评估与排序问题,提高了舰艇编队防空作战能力.     

Maintaining systems with heterogeneous spare parts

We consider the problem of optimally maintaining a stochastically degrading, single‐unit system using heterogeneous spares of varying quality. The system's failures are unannounced; therefore, it is inspected periodically to determine its status (functioning or failed). The system continues in operation until it is either preventively or correctively maintained. The available maintenance options include perfect repair, which restores the system to an as‐good‐as‐new condition, and replacement with a randomly selected unit from the supply of heterogeneous spares. The objective is to minimize the total expected discounted maintenance costs over an infinite time horizon. We formulate the problem using a mixed observability Markov decision process (MOMDP) model in which the system's age is observable but its quality must be inferred. We show, under suitable conditions, the monotonicity of the optimal value function in the belief about the system quality and establish conditions under which finite preventive maintenance thresholds exist. A detailed computational study reveals that the optimal policy encourages exploration when the system's quality is uncertain; the policy is more exploitive when the quality is highly certain. The study also demonstrates that substantial cost savings are achieved by utilizing our MOMDP‐based method as compared to more naïve methods of accounting for heterogeneous spares.     

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019