多Agent系统中Agent计算的能力理论

能力是规范Ａｇｅｎｔ的一个重要抽象概念。本文提出了规划树概念以刻划在动态、不确定的多Ａ－ｇｅｎｔ系统中Ａｇｅｎｔ如何通过对其规划进行合理、有效的组织来实现其任务、维护某些条件。基于规划树概念,本文给出了能力概念的形式化语义定义,获取和描述了它的一些重要属性。     

多Agent系统计算的意愿理论

意愿是规范和描述多Ａｇｅｎｔ系统的一个重要抽象认知概念。本文提出了多Ａｇｅｎｔ系统计算的意愿理论以支持多Ａｇｅｎｔ系统计算的理论研究。基于多Ａｇｅｎｔ系统计算的动作模型理论，我们给出了意愿概念新的语义定义，获取和描述了它的一些重要逻辑属性。     

军事通信网络互连网关

本文描述数字战略－战术网关,简述战术分组无线网－Ｂ－ＩＳＤＮ网关,增强型多网密网关和ＴＡＣＬＡＮＥ密网关。     

一种多功能终端同步数据通信的实现方法

本文介绍了在多功能终端设计中使用的一种ＨＤＬＣ同步数据通信的实现方法,以及保证信息正确传输的ＧＡＮ－ＡＱＲ差错控制流程。     

不同加载方法对甲板大开口分段有限元计算的误差分析

利用ＭＳＣ－ＮＡＳＴＲＡＮ有限元程序模拟计算甲板大开口的应力．建立简单的总体和分段力学模型，采用不同的加载方法进行甲板应力计算，将局部应力计算结果与整体应力计算结果比较，得出各种加载方法有限元计算的误差，从而给出误差小、建模简单的局部分段模型加载的最佳方法．     

一组新型希伯尔(SCHIEBEL)探测器

被美军称做ＡＮ／ＰＰＳ－１２实为ＡＮ－１９／２希伯尔探雷器,曾在海湾战争后科威特的扫雷行动中发挥了重要作用,一时名声鹊起。这里介绍的是此种牌号从袖珍至大型探雷器系列。     

一个战术防空训练中心及其目标视景系统

Ｆｅｒｒａｎｔｉ计算机系统公司按照英国ＤＥＦＳＴＡＮ０５－２１（北约ＡＯＡＰ）标准为英国国防部研制了多种防空武器的训练模拟系统,并出口国外。文章详细介绍了该公司的一种战术防空训练中心以及其中的目标视景系统。     

一种大扭矩制动器优化设计方法

为解决大惯量飞轮储能系统应急制动器优化设计的难题,提出了适用于多目标、多约束问题的改进粒子群算法。该算法利用加权算法将多目标优化问题转换为单目标优化问题,并通过罚函数方法将多约束问题转化为普通约束问题,再采用粒子群寻优算法进行求解。样机试验验证了大容量飞轮储能系统制动方案的可行性与摩擦制动器优化算法的优良性能。     

基于时滞分割法的具有leakage项时滞的离散型神经网络状态估计

摘要：研究一类具有leakage时滞的离散型神经网络的状态估计问题．通过构造新的Lyapunov泛函得到保证估计误差全局渐近稳定的充分条件,并通过求解一个线性矩阵不等式（LMI）得到状态估计器的增益矩阵．采用一种新的时滞分割方法将变时滞区间分割为多个子区间,使该结果在获得更小的保守性同时也降低了计算的复杂度．     

网络化战场环境下多无人机调度问题

针对网络化战场下无人机(UAV)跨区飞行、信息共享等特点扩大了任务区域与规模而引发任务分配难题,对无人机运动及通信特性、任务时间窗约束和初始战场布局等因素建模,根据目标属性对其分组以降低问题复杂度,应用优化算法得到初始解,随后进行全局交换、删除及插入等调整得到最终调度方案,由此搭建快速求解多UAV任务调度的通用算法框架。最后应用遗传算法验证,仿真结果表明:该框架在解决多无人机大规模任务分配时具有较好的时效性和适应性。     

一个多Agent系统合作模型

从多Agent系统的组成结构出发,综述合作问题的理论机制,提出了采用多Agent系统模型来求解逻辑推理问题的方法,根据各Agent自身意图,相互合作以达成群体目标。     

Bicriteria multiresource generalized assignment problem

In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621–636, 2014     

Chance‐constrained multi‐terminal network design problems

We consider a reliable network design problem under uncertain edge failures. Our goal is to select a minimum‐cost subset of edges in the network to connect multiple terminals together with high probability. This problem can be seen as a stochastic variant of the Steiner tree problem. We propose two scenario‐based Steiner cut formulations, study the strength of the proposed valid inequalities, and develop a branch‐and‐cut solution method. We also propose an LP‐based separation for the scenario‐based directed Steiner cut inequalities using Benders feasibility cuts, leveraging the success of the directed Steiner cuts for the deterministic Steiner tree problem. In our computational study, we test our branch‐and‐cut method on instances adapted from graphs in SteinLib Testdata Library with up to 100 nodes, 200 edges, and 17 terminals. The performance of our branch‐and‐cut method demonstrates the strength of the scenario‐based formulations and the benefit from adding the additional valid inequalities that we propose. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 321–334, 2015     

连续信息空间中的信息泄漏问题研究

在联邦式作战仿真平台中,互相通信的主体在进行通信的同时还需要保护其私有的信息。讨论了基于线性方程组“无穷解”条件下的连续信息空间的信息泄漏和保护问题,包括该模型的基本特性和防止泄漏的方法,指出了存在信息的部分泄漏问题,并给出了检测部分泄漏的方法,为提高计算性能,可指定检测子空间,最后,讨论了信息动态改变对信息泄漏的影响。     

A selective newsvendor approach to order management

Consider a supplier offering a product to several potential demand sources, each with a unique revenue, size, and probability that it will materialize. Given a long procurement lead time, the supplier must choose the orders to pursue and the total quantity to procure prior to the selling season. We model this as a selective newsvendor problem of maximizing profits where the total (random) demand is given by the set of pursued orders. Given that the dimensionality of a mixed‐integer linear programming formulation of the problem increases exponentially with the number of potential orders, we develop both a tailored exact algorithm based on the L‐shaped method for two‐stage stochastic programming as well as a heuristic method. We also extend our solution approach to account for piecewise‐linear cost and revenue functions as well as a multiperiod setting. Extensive experimentation indicates that our exact approach rapidly finds optimal solutions with three times as many orders as a state‐of‐the‐art commercial solver. In addition, our heuristic approach provides average gaps of less than 1% for the largest problems that can be solved exactly. Observing that the gaps decrease as problem size grows, we expect the heuristic approach to work well for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

一种改进的武器效能评估方法

提出了改进的武器系统效能模糊评估方法,避免了原有方法存在的问题。将武器系统效能评估视为模糊多准则决策问题,通过“目标-准则-系统”层次结构,利用5个模糊比率表示判断矩阵和准则权重向量,将问题转化为模糊数的排序问题,从而选出被评武器系统最优者。与两种武器系统效能评估方法的比较显示新方法是可信有效的。     

竞争性假设分析法在群体性事件情报预警中的应用

目前，边防部门对于群体性事件预警情报的分析缺乏科学系统的工作流程和分析思路，受思维定势、先入为主等主观因素的影响较为严重。随着科学技术的不断发展，群体性事件预警情报的来源不断扩展，数量不断攀升，如何进行准确的情报分析，成为边防部门面临的一个亟待解决的问题。分析了竞争性假设分析法在群体性事件情报预警中的可行性和实际应用，对预警情报的分析工作有一定的借鉴价值。     

一种基于 TIN 表达的碰撞检测方法研究

在扼要介绍有关碰撞检测方法的基础上 ,着重研究一种基于TIN (TriangulatedIrregularNetwork)表达的物体之间的几何碰撞检测方法。有效地解决了其中的完整性控制问题 ,并在路径规划等系统中得以成功运用。