消防无线通信存在问题及对策研究

介绍了我国消防无线通信在灭火救援中的重要性,重点从消防通信装备的配备、技术和管理等方面分析了消防无线通信在使用中存在的问题,并提出了解决这些问题的对策。     

集群通信在消防通信调度指挥系统中的应用

无线通信网是消防部队在执行灭火抢险救援任务时,确保完成信息传达、灭火抢险救援指挥、协同作战等任务的关键。为了更好的开发集群通信的功能,介绍了集群通信的概念、组网方式,并探讨了通信区域扩展的方法。     

基于遭遇角决策的并行双模切换舵减摇控制

结合舵减摇控制中通用线性模型与模糊线性模型的优缺点,采用了一种根据遭遇角的不同自动切换控制器设计模型的并行双模切换舵减摇控制方案。为在线自动辨识遭遇角,提出基于横摇功率谱密度柱状图的神经网络辨识方法。仿真结果表明,该方法辨识精度较高,且比传统重心法节省了在线计算量与存储数据库所需的存储空间,简化了辨识流程。     

二元探测传感器网络的递推加权质心目标定位算法

为进一步降低二元探测传感器网络质心定位算法的计算复杂度和通信量、提高定位精度,推导出一种质心算法的递推公式,使用该递推公式可以大大减少定位的计算、存储和通信量;在递推质心公式的基础上,提出了一种基于节点探测到目标的次数的递推加权质心定位算法,从而提高了定位精度.对递推公式和加权质心算法进行了模拟仿真,结果验证了递推公式和加权递推质心算法的有效性.     

军用无线传感器网络体系结构研究

无线传感器网络作为一种全新的监测系统被广泛认为是军用侦查探测系统的发展方向,已经成为国际军事领域研究热点。在总结了几种无线传感器网络体系结构的基础上,针对军用领域特定的性能需求,对这些体系结构进行了比较。     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

稳定自组织网络结构中单点突变对网络稳定性影响

从战场恶劣环境通信设备无法正常通信的条件下,介绍了一种自组织网络稳定度的模型。通过比较自组织网络结构中微结构和巨结构的优缺点,动态地描述了结构间的聚合和裂解。基于结构分析,考虑单点突变对网络稳定性的影响,从时间因素策略方面,提出了一个基于预测最稳定链路生存时间的一种分布式成群策略。通过合理建模以及优化路由算法,尽可能地维护网络结构的稳定。     

基于复杂网络的作战描述模型研究

针对传统作战模型重点关注兵力的毁伤,不能充分地反映信息时代作战的特点,提出了一个基于复杂网络的作战描述模型,把作战单元抽象成节点,把各单元之间的相互作用抽象成有向边,将战场描述为一个由传感器、决策器、影响器、目标四类节点组成的有向网络图。定义了网络模型的若干特征参数,把作战环看成是反映作战能力的指标,并区别分析了标准作战环和广义作战环,能更好地反映信息时代作战的特点。最后实例研究了传统作战条件下决策器连通程度的变化给作战能力带来的影响。     

Revisiting inspection game and inspector leadership through reaction networks

The inspection game is a two-player noncooperative game that models a situation where an inspector verifies whether the inspectee complies with the rules (on the assumption that the inspectee has the tendency to violate at least one of the rules). The usual approach in the analysis of this game seeks to find an optimal strategic inspection scheme for each of the two players yielding favorable payoffs. Recently, there have been some developments in the study of such games that use a mathematical structure known as reaction network involving a set of molecular species and the existing reactions among these species. In this paper, we use a reaction network to analyze the inspection game giving an alternative way of modeling the social situation. The molecular species play the role of the players' decision moves and their resulting gain or loss, while the reactions are the encounters of the decisions of the players which, as expected, yield payoffs. We reexamine the dynamics of the inspection game through the lens of reaction network theory and consider various situations that call for more detailed analyses such as equal or unequal reaction rates and inspection leadership. Conditions concerning reaction rates, initial population of decision species, benefits, and costs are determined in order to identify strategies that yield better payoffs both for the inspector and inspectee. These results illustrate practical insights rooted from the formulated simple game models.