Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

任务分配问题的对称群方法

探讨了无人飞行器(UAV)编队的任务分配问题。任务分配是UAV协同控制的基础,其解是任务区域内各任务的一个排列。求解UAV任务分配问题的有效方法是能在合理的计算时间内找到近似最优解的启发式算法。用对称群描述UAV任务分配的搜索空间,基于右乘运算构造搜索邻域。仿真结果验证了群论禁忌搜索算法的有效性。     

基于离散降雨衰耗状态的卫星信道模型

针对Ka频段卫星信道中降雨衰耗的统计分布特点,建立了基于离散降雨衰耗状态的卫星信道模型,模型中各状态组成离散的Markov链并由其转移概率矩阵来表示,分析此模型下的信道误比特性能和数据包丢失性能。此模型能够适用于链路层以及高层通信协议。     

带三维落角约束的寻的导弹制导与姿控系统设计

针对带三维落角约束的寻的导弹制导与姿态控制系统设计问题,提出一种基于终端滑模控制和扩张状态观测器的六自由度制导控制系统设计方法。建立包含模型不确定项的寻的导弹六自由度质心与绕质心模型,设计内外双层环路六自由度制导控制系统框架;基于弹-目三维相对运动模型和坐标系转移矩阵建立以攻角和侧滑角为输入的三维全耦合导引方程,利用终端滑模控制方法和扩展状态观测器得到期望的攻角和侧滑角并将其转化为对应的俯仰、偏航和滚转角指令;根据线性形式的寻的导弹绕质心动力学方程,设计与俯仰、偏航和滚转角相关的滑模面向量,并利用终端滑模控制方法和扩张状态观测器得到寻的导弹的副翼偏角、方向舵偏角和俯仰舵偏角指令。六自由度数值仿真结果验证了该方法的有效性和鲁棒性,并证明了该制导控制系统设计方法能以较少的控制设计参数完成预设的制导控制任务。     

多帧高斯混合概率假设密度的多目标跟踪算法

针对低检测概率下多目标跟踪时,概率假设密度滤波器难以正确估计当前目标个数以及目标状态问题,提出一种基于多帧融合的高斯混合概率假设密度滤波算法。根据不同时刻目标权值构造目标多帧权值记录集及目标状态抽取标志。当某些时刻目标被漏检时,依据目标状态抽取标志,并结合目标多帧权值记录集中权值信息估计丢失目标的状态。仿真实验表明,算法有效地提高了低检测概率下现有相关算法的目标状态和数目估计精度。     

一种基于部分搜索的GNSS模糊度解算方法

为解决LAMBDA算法搜索策略效率不高的问题,提出了一种基于部分搜索的模糊度解算新方法。该方法的解算成功率接近LAMBDA算法,且只需对最后3维模糊度元素采取搜索策略。同时,通过合理设定搜索椭球的大小和搜索策略;大大提高了搜索效率。通过实验对该新算法与Bootraping算法、LAMBDA算法进行了比较分析,进一步验证了该新算法的有效性。     

求解CVRP问题的一种改进启发式蚁群算法

针对蚁群算法求解CVRP问题时收敛速度慢、求解质量不高的缺点,提出了一种改进启发式蚁群算法。该算法借鉴蚁群系统和基于排列的蚂蚁系统的优点设计信息素更新策略,既加强了对每次迭代最好解的利用,又避免了陷入局部最优;按一定比例使用基本方法和基于PFIH方法构造路径,扩大了算法的搜索空间;采用一种混合局部搜索算子,增强了算法局部寻优能力。实验结果表明,改进启发式蚁群算法可以大幅度减少车辆运行成本,具有较快的收敛速度。     

Ethnic crises and national security in Nigeria

The article focuses on the interface between ethnicity and national security in Nigeria. It critically explores the negative mobilization of ethnicity in Nigeria's fourth republic, and how this has been shaping (and reshaping) the democratization process, particularly in the management of cooperation and conflict over contestations for power and other resources. The re-democratization of Nigeria in 1999 has been preceded with high expectations of meaningful reductions in the high level of insecurity witnessed under the long years of military suzerainty. However, this has not been the case. Rather, what is obtained is an increase in national insecurity on a much larger scale. This article argues that one of the banes of national security in the Nigerian state is ethnic politics, which continues to witness changes in context and character with grave consequences for the future of democracy. The central argument is that ethnicity has always been a major driver of politics and conflicts in Nigeria and the trend is not likely to change anytime soon.     

远程制导火箭子母弹对机场跑道毁伤研究

对机场跑道毁伤封锁是远程制导武器的重要任务,其毁伤判断的依据是最小升降窗口存在与否。采用Monte-Carlo方法对远程制导火箭子母弹打击机场跑道的炸点分布进行仿真模拟,提出了一种改进的搜索飞机起降最小升降窗口算法,并用该算法计算分析了远程制导火箭子母弹相关战技术因素对机场跑道毁伤的影响程度。计算结果表明改进算法计算封锁概率的值相对于区域搜索算法更加精确,研究结果对远程制导火箭子母弹的作战运用及进一步优化设计具有参考与实用价值。