军事云环境下基于动态博弈的资源调度方法

针对军事云环境下联合指挥资源调度优化问题,综合考虑了多部队任务需求,多目标优化,多部队资源竞争等约束条件,运用动态博弈理论及方法,建立并提出了一种基于完全信息扩展博弈的资源调度模型及方法,提高了资源调度效率,兼顾了多部队利益,增加了联合作战效益。最后通过实验验证了其有效性及准确性。     

基于合作博弈的智能集群自主聚集策略

以无人车集群系统协同监视再入体着靶过程为任务背景,开展智能集群自组织策略相关技术研究。设计无人车集群执行再入体着靶协同监视的集群行为模式;针对协同监视过程中的集群聚集行为,提出基于合作博弈的智能集群自主聚集策略。各智能体以实现群体聚集为"合作目标",以降低自身能量消耗为"竞争目标",开展博弈;基于微粒群算法规划局部路径,最终使群体系统涌现出聚集行为。仿真实验验证了设计的自主聚集策略的有效性。     

The timing of contests

We develop a simple model to analyze the timing of contests. When the odds of winning a contest are exogenously given – we show that if either the players discount the future or if the total cost of contest is smaller in the future – there exist subgame perfect equilibria where both players settle, anticipating a contest in the future. With endogenous efforts, the aggregate efforts expanded in a contest are smaller if the contest occurs in the future when the relative effort productivities remain constant or diverge over time, thus creating scope for delay in contests. When the effort productivities converge over time, the total efforts may be greater under a future contest. As a consequence, players either settle over the two periods, or else they initiate a contest immediately.     

舰载反潜直升机吊放声纳区域反潜策略建模

为提高舰载反潜直升机吊放声纳区域反潜搜索作战效能,对舰载反潜直升机吊放声纳区域反潜搜索策略问题进行了建模。根据潜艇目标位置信息的不确定性,研究了潜艇目标位置信息的概率分布函数,采用Markov状态转移概率矩阵描述了潜艇目标位置信息变化的方法。其次,给出了基于贝叶斯理论的潜艇目标信息概率分布函数更新公式。再次,推导了舰载反潜直升机吊放声纳区域反潜最优策略,给出了舰载直升机吊放声纳区域反潜搜索算法。最后给出了典型案例,验证了反潜搜索策略的有效性。研究成果可为舰载反潜直升机吊放声纳区域反潜提供决策依据。     

中国空间安全形势

随着中国在太空领域的不断崛起,太空地位不断提升的同时,也面临着各种各样的挑战,这些挑战既有源自传统政治领域的大国阻挠,也有来自外太空的人类共同威胁。为了应对这些威胁和挑战,保护中国的太空利益和国家利益,我们需要从多方面着手,多管齐下,以维护日益重要的中国国家太空利益。     

Cost allocation of capacity investment games

Consider a manufacturer serving a set of retail stores each of which faces deterministic demands in a finite planning horizon. At the beginning of the planning horizon, the production capacity of the manufacturer is built, followed by production, outsourcing to third party manufacturers if necessary and distribution to the retail stores. Because the retail stores are usually managed by different managers who act as independent profit centers, it is desirable that the total cost is divided among the retail stores so that their incentives can be appropriately captured and thus efficient operations can be achieved. Under various conditions, we prove that there is a fair allocation of costs among the retail stores in the sense that no subset of retail stores subsidizes others, or equivalently, the resulting capacity investment game has a nonempty core, that is, the capacity investment game is a balanced game. In addition, our proof provides a mechanism to compute a fair cost allocation. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 512–523, 2013     

Pricing bridges to cross a river

We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

一种基于自适应阈值估计算法的SAR图像去噪方法

为去除乘性相干斑噪声对合成孔径雷达(Synthetic Aperture Radar,SAR)图像的影响,将小波域去噪和二维平移不变去噪算法进行有效结合,提出一种新的自适应阈值估计算法.基于概率密度函数和贝叶斯估计理论,可以得到子带阈值.通过对数变换,将算法应用于含相干斑噪声的SAR图像去噪.理论分析和实验结果表明该算...     

指挥员作战决策行为的EWA学习模型分析

摘要：为在根本上提高作战决策质量,从行为学角度入手,以指挥员这一“人”为中心,并结合认知科学、心理学等知识对指挥员作战决策行为进行研究。从博弈角度出发,通过引入EWA模型,对指挥员作战决策行为进行分析和优化。结果表明,EWA模型,特别是加入“老练”指挥员后的模型能够明显改善指挥员决策行为,对指挥员,尤其是经验匮乏的指挥员决策行为表现有着重要的作用。     

对策理论的防空作战决策级融合模型

随着防空C3I系统的发展,防空作战决策的过程较以往更为自动化,用于生成各种作战辅助决策方案的计算机模型也具备随着作战环境改变所表现出一定的自适应调整的特征.影响防空作战决策结果正确性的因素众多,表现这些因素的信息有些是冲突的,为得到更为准确、有效的决策方案,各类冲突信息的处理成为防空作战的核心问题.构造了一种在冲突信息环境下基于对策理论的融合模型,以对策理论的相关算法实现了融合中心各类信息的交互决策.实践表明,这一融合模型能有效地解决防空作战决策中各类信息的综合处理问题,具有一定的实用价值.