用于自适应阵超角分辨的非均匀线阵设计问题

文中讨论了非均匀线阵自适应超角分辨问题,证明了在入射场条件一定的情况下,特征矢量角谱性能完全由阵列因子决定。通过分析与仿真,说明最小冗余阵(LMR) 是一种性能优良的超角分辨阵。并讨论了非均匀线阵存在的栅瓣问题,给出避免栅瓣的单位间距的上限公式。     

无线电引信海杂波自适应抵消器

本文分析了海杂波干扰对无线电引信反导效果的影响,提出了采用自适应噪声抵消器来消除海杂波干扰的方法,并对有关参数的选取进行了探讨,最后给出了用电荷耦合器件CCD组成自适应海杂波抵消器的原理方案。     

频率步进雷达距离旁瓣抑制自适应脉冲压缩算法

在频率步进雷达中,通常使用逆快速傅里叶变换方法进行高分辨成像。由于逆快速傅里叶变换的距离旁瓣高,有可能造成强散射点旁瓣掩盖附近弱散射点或者弱小目标情况,限制了其在强杂波环境下的使用。为了抑制高距离旁瓣,近年来提出一种基于最小均方误差准则的自适应脉冲压缩方法。基于自适应脉冲压缩算法原理,推导了频率步进雷达距离旁瓣抑制算法。针对静止和运动目标场景,分析自适应脉冲压缩算法的旁瓣抑制性能。仿真结果表明,与逆快速傅里叶变换和加窗逆快速傅里叶变换处理比较,自适应脉冲压缩算法具有更好的旁瓣抑制效果,能够更好地检测强散射点附近的弱散射点或者弱小目标。     

基于多目标的雷达组网传感器资源管理算法

在雷达组网系统的多目标跟踪过程中,当目标数量过多时,由于传感器资源不足,无法使用传统传感器的管理方法进行资源分配,且运算时间过长,不满足工程实际需求。针对以上问题,提出了一种新的多传感器多目标跟踪任务快速分配算法,该算法将跟踪目标个数和跟踪目标精度作为优化目标,首先按照设定的分配准则对传感器进行一次分配,最大化跟踪目标个数;然后利用一种基于传感器排序的启发式传感器分配方法进行二次分配,通过控制跟踪目标的协方差水平,使目标的跟踪精度尽量接近期望值。仿真结果表明,该算法能够在较短的时间内对多传感器进行有效快速地分配,既跟踪了更多的目标,又达到了期望目标的跟踪精度,并且在一定程度上控制资源消耗,减少系统的总耗能。     

基于先验知识的降秩STAP方法研究

提出了一种基于杂波先验知识的降秩(RR)空时自适应处理(STAP)方法——KA-RR法,该方法首先利用载机平台运动参数、雷达系统参数及地形、地貌参数等先验知识构建机载雷达杂波模型,然后通过该模型对机载雷达杂波数据进行预白化处理,最后利用降秩STAP方法自适应抑制剩余杂波。仿真结果表明,相对于传统的降秩STAP方法,KA-RR方法具有更好的杂波抑制性能和更强的鲁棒性。     

基于CAS/Agent的装甲装备战损模型仿真

针对传统战损模型研究方法存在的不足,提出用人工神经网络的学习能力模拟Agent的适应性。借鉴CAS(Complex Adaptive System)理论的建模思想,引入ERA(Environment-Rules-Agents)方案建立战损模型。在外部干预Agent作用下,运用BP算法并结合CT(Cross Target)算法对红蓝双方对抗战斗进行仿真,模拟动态战场环境下装备损伤的演化过程。该模型可更好地理解装备损伤的动力学特性。     

Client‐contractor bargaining on net present value in project scheduling with limited resources

The client‐contractor bargaining problem addressed here is in the context of a multi‐mode resource constrained project scheduling problem with discounted cash flows, which is formulated as a progress payments model. In this model, the contractor receives payments from the client at predetermined regular time intervals. The last payment is paid at the first predetermined payment point right after project completion. The second payment model considered in this paper is the one with payments at activity completions. The project is represented on an Activity‐on‐Node (AON) project network. Activity durations are assumed to be deterministic. The project duration is bounded from above by a deadline imposed by the client, which constitutes a hard constraint. The bargaining objective is to maximize the bargaining objective function comprised of the objectives of both the client and the contractor. The bargaining objective function is expected to reflect the two‐party nature of the problem environment and seeks a compromise between the client and the contractor. The bargaining power concept is introduced into the problem by the bargaining power weights used in the bargaining objective function. Simulated annealing algorithm and genetic algorithm approaches are proposed as solution procedures. The proposed solution methods are tested with respect to solution quality and solution times. Sensitivity analyses are conducted among different parameters used in the model, namely the profit margin, the discount rate, and the bargaining power weights. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

New heuristic methods for the capacitated multi‐facility Weber problem

In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?_p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006     

Probabilistic solution and bounds for serial inventory systems with discounted and average costs

We consider the infinite horizon serial inventory system with both average cost and discounted cost criteria. The optimal echelon base‐stock levels are obtained in terms of only probability distributions of leadtime demands. This analysis yields a novel approach for developing bounds and heuristics for optimal inventory control polices. In addition to deriving the known bounds in literature, we develop several new upper bounds for both average cost and discounted cost models. Numerical studies show that the bounds and heuristic are very close to optimal.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

防发散无迹卡尔曼滤波自适应网格交互式多模型算法

针对非线性观测条件下的机动目标跟踪问题,基于机动目标的协同转弯模型,采用防发散无迹卡尔曼滤波方法和自适应网格的模型集自适应策略,研究了一种变结构交互式多模型算法。对二维机动目标跟踪的仿真结果表明,该算法与相应的固定结构交互式多模型算法相比,可以解决固定结构多模型算法存在的问题,有效提高多模型算法的精度和费效比,缩短计算时间,且适合工程应用。