基于HLA的多平台协同制导作战仿真系统设计与实现

根据编队协同防空作战的特点和需求,设计并开发了一个基于高层次体系结构(HLA)的多平台协同制导作战仿真系统.阐述了该系统设计的总体结构和工作原理,提出了主要功能模块需求,重点分析了主要系统单元的信息交互与控制流程.根据上述分析,对系统进行了联邦开发、对象类和交互类设计以及流程设计.最后,通过仿真实例验证了该系统的可行性...     

基于概率神经网络的编队协同防空威胁评估

为了有效地进行防空作战部署,确保重点目标不受或少受损失,以防空作战实际需要为出发点,针对目前多平台协同防空作战中目标威胁评估问题普遍存在的不足,从舰艇编队的整体角度出发,运用概率神经网络的方法,建立了编队协同防空目标威胁评估问题的数学模型,给指挥员提供了正确决策。通过实例验证,证明了该模型的有效性和正确性。     

基于操纵件状态时序变化的车辆换挡动作识别方法

为了解决驾驶训练中乘员操纵动作难以保留和再现,而无法进行深入分析的不足,提出了用操纵件位移数据记录乘员动作,用状态变化矩阵描述动作过程,用驾驶规则中规定的动作时序特征识别乘员特定操作动作等一系列新方法,实现了车辆驾驶动作的数字化记录、智能化识别和自动化评估。     

协同通信中改进的机会选择策略研究

协同通信是近几年无线通信技术的研究热点,协同中继的选择策略直接影响到协同通信系统的性能。文章以多节点协同通信网为系统模型,研究了两种改进的机会选择策略,分析推导了该策略的中断概率的近似表达式,结果表明,这两种策略均可以获得比传统的机会选择策略更好的中断概率性能。     

日本预防街头犯罪对策与启示

在剖析解读日本街头犯罪＂预防对策＂的基础上,提出日本警察运用简单手段取得社会治安的理想效果。预防犯罪,在理念上把警方全包全责调整向组织牵头、协调联动和指导督促;在实践上完善警察牵头,以警察、政府相关部门、生产相关企业、新闻媒体和普通民众等广泛参与为基础的联动群防机制;在落实上不断加强高技术手段与原始方法相互补充的立体防范环境建设;在过程中尽量贴近现实需要,以完整的系统来控制街头犯罪,是降低预防犯罪成本、提高预防犯罪效率的捷径之一。     

合作学习理论在外语教学中的应用——以“澳大利亚课堂教学”为例

在阐释合作学习理论的基础上,分析了合作式教学的基本特征,并以澳大利亚英语课堂教学活动为例,探讨如何运用合作互动型模式提高外语学习效果。该理论的应用为改进学生英语课堂参与行为及参与模式提供教学启示。     

基于随机漫游模型的协同搜索力最优分配方法

针对多平台协同搜索的最优搜索问题,以多无人机区域搜索任务为背景,将搜索论和随机规划引入到编队协同搜索中,建立了环境模型、无人机模型、传感器模型;为了解决目标丢失后的“应召”搜索问题,建立了目标的随机漫游模型;通过对搜索力最优分配问题的分析,认为其实质为一类线性规划问题,提出了一种基于递归原理的解算方法;最后,通过仿真计算,证明了该随机漫游模型的合理性,并验证了所提算法的有效性。     

一种基于多Agent强化学习的多星协同任务规划算法

在分析任务特点和卫星约束的基础上给出了多星协同任务规划问题的数学模型.引入约束惩罚算子和多星联合惩罚算子对卫星Agent原始的效用值增益函数进行改进,在此基础上提出了一种多卫星Agent强化学习算法以求解多星协同任务分配策略,设计了基于黑板结构的多星交互方式以降低学习交互过程中的通信代价.通过仿真实验及分析证明该方法能...     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Game theoretic analysis of maximum cooperative purchasing situations

This article introduces maximum cooperative purchasing (MCP)‐situations, a new class of cooperative purchasing situations. Next, an explicit alternative mathematical characterization of the nucleolus of cooperative games is provided. The allocation of possible cost savings in MCP‐situations, in which the unit price depends on the largest order quantity within a group of players, is analyzed by defining corresponding cooperative MCP‐games. We show that a decreasing unit price is a sufficient condition for a nonempty core: there is a set of marginal vectors that belong to the core. The nucleolus of an MCP‐game can be derived in polynomial time from one of these marginal vectors. To show this result, we use the new mathematical characterization for the nucleolus for cooperative games. Using the decomposition of an MCP‐game into unanimity games, we find an explicit expression for the Shapley value. Finally, the behavior of the solution concepts is compared numerically. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 607–624, 2013