具有坐标耦合和处理时滞的二阶离散多智能体系统的一致性

根据系统的拓扑结构、离散步长和旋转矩阵的旋转角,确定系统的渐近行为,给出多智能体系统达成二阶一致性的充要条件。证明了当0是拉普拉斯矩阵的一个简单特征值且离散步长、旋转角小于由代数方程确定的临界值时,会出现渐近一致性。数值模拟结果证明理论结果的正确性。设计了特征参数影响二阶一致性的相关案例,说明特征参数相关结论可为控制理论的一致收敛分析提供重要判据和理论支撑。     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

态势估计中的二维模糊空间知识处理

空间推理是态势估计中的一个重要组成部分。针对海战态势估计的要求,建立了模糊确定性下二维空间点、区域,以及几种对态势估计中常用的空间关系的数学模型和用来确定空间关系的计算方法。     

计算破损船舶稳性的表面元法

采用表面元法计算船舶的稳性 .这种方法是把船舶的表面分解成许多小的表面单元 ,然后计算在某一倾角下每个小单元所承受的静压力 ,对静压力进行积分就可得到浮力的大小、方向和作用线 ,从而算出某倾角下的回复力矩 .对实船的稳性计算结果表明 ,无论是破损船 ,还是未破损船 ,这种方法都适用     

雷电回击地面水平电场的解析求解

假定大地为良导电平面 ,基于DU模型计算了雷电回击地面电磁场 ,并探讨了地面水平电场的求解。对于雷电回击水平电场的两种近似求解方法———大地表面阻抗法和斜波法 ,进行了解析推导 ,并从数学上证明了两种方法在远区场的等价法。     

数字式相位差测量方法及精度分析

相位差变化率是最近提出的用于快速无源定位的观测量。该文研究相位差的高精度测量方法 ,提出了一种正交双通道数字式的相位差测量方法。通过对信号频谱的分析 ,计算了测量系统输出的信噪比 ,从而得出了相位差测量的理论精度 ,随后进行仿真分析验证了理论精度。理论分析和仿真实验证明 ,论文提出的方法可以实现高精度的相位差测量     

一种基于估计熵的自适应模糊滤波器及其在箭遥信号处理中的仿真应用

介绍了一种基于估计熵的自适应模糊滤波器 ,并将其应用于宽带噪声中火箭遥测速变信号的数字滤波。讨论了自适应模糊滤波算法 ,给出了应用实验结果。分析和实验表明 ,这种新型滤波器能根据信号的复杂程度自动调节其参数 ,对宽带噪声中非平稳随机信号有较好的滤波效果     

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

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