基于惩罚SCA的分布式网络化雷达多目标跟踪射频隐身资源联合分配方法

    A Joint Allocation Method for RF Stealth Resources in Distributed Networked Radar Multi-Target Tracking Based on Penalized SCA

    • 摘要: 针对分布式网络化雷达在多目标跟踪背景下如何保证跟踪精度并减少辐射资源消耗,进而增强射频隐身能力的问题,本文设计了一种雷达功率与驻留时间联合优化分配方法。首先,建立包含节点选择与物理辐射参数的贝叶斯克拉美-罗下界(BCRLB),并针对位置与速度量纲差异易致优化权重失真,引入位置选择矩阵构建量纲统一的误差下限,消除量级干扰。然后,以极小化雷达归一化辐射功率与驻留时间的加权和为目标,在满足预设跟踪精度门限且系统总辐射资源不超过上限的双重要求下,得到一个带有非凸约束的非线性资源分配问题。最后,针对该模型的非凸特性,引入松弛变量将非凸约束转化为罚项,以此扩大迭代可行域,避免传统SCA(Sequential Convex Approximation)算法易出现的不可行问题,通过动态更新惩罚因子并采用内点法处理凸子问题。仿真结果表明,相比资源均匀分配算法,本文算法能够自适应按需分配跟踪资源,节省资源消耗,增强分布式网络化雷达的射频隐身能力。

       

      Abstract: In multiple target tracking scenarios, distributed networked radars face the challenge of maintaining tracking accuracy while minimizing radiation resource consumption to enhance radio frequency (RF) stealth. To address this issue, this paper proposes a joint allocation method for radar transmit power and dwell time. First, the Bayesian Cramér-Rao lower bound (BCRLB) is derived, which incorporates node selection variables and physical radiation parameters. However, the dimensional differences between position and velocity often cause optimization weight distortion. To overcome this, a position selection matrix is introduced to construct a dimensionally unified error lower bound, thereby eliminating magnitude interference. Subsequently, a nonlinear resource allocation problem is formulated to minimize the weighted sum of normalized transmit power and dwell time. This formulation is subject to two constraints: a preset tracking accuracy threshold and an upper limit on the total system radiation resources. Consequently, the resulting optimization model contains non-convex constraints. To handle this non-convexity, slack variables are introduced to convert non-convex constraints into penalty terms. This approach expands the iterative feasible region and prevents the infeasibility issues commonly encountered in the traditional sequential convex approximation (SCA) algorithm. Furthermore, the penalty factors are updated dynamically, and the convex subproblems are solved using the interior-point method. Simulation results demonstrate that, compared with the uniform resource allocation algorithm, the proposed method can adaptively allocate tracking resources on demand. It effectively reduces resource consumption and enhances the RF stealth capability of distributed networked radars.

       

    /

    返回文章
    返回