基于最佳邻域搜索算法的协同干扰资源分配方法

    A Method of Cooperative Interference Resource Allocation Based on Best Neighborhood Search Algorithm

    • 摘要: 针对协同干扰中干扰资源分配问题,提出了一种基于最佳邻域搜索算法的干扰资源分配方法。首先,定义了两种基础邻域移动操作,保证状态空间中相邻状态有固定的汉明距离,从而降低了干扰效能评估的计算复杂度;随后,通过最佳邻域搜索保证干扰效能严格单调递增,提高了算法的收敛效率;最后,结合提出的加权初值生成策略,进一步提高最佳邻域搜索算法输出全局最优解的概率。仿真结果表明,相较传统的群智能算法与强化学习方法,所提出方法具有较好的收敛精度、收敛效率与计算复杂度,且在较大规模的问题下有更大优势。

       

      Abstract: A novel interference resource allocation method based on best neighborhood search algorithm (BNS) is proposed to address the interference resource allocation problem in cooperative jamming. Firstly, two fundamental neighborhood move operations are defined to ensure that adjacent states in the state space maintain a fixed hamming distance, thereby reducing the computational complexity of interference effectiveness evaluation. Subsequently, the best neighborhood search algorithm ensures strict monotonic increase of interference effectiveness, significantly improving the algorithm's convergence efficiency. Finally, by integrating the proposed weighted initial value generation strategy, the probability of achieving the global optimal solution is further enhanced. Simulation results demonstrate that compared to traditional swarm intelligence algorithms and reinforcement learning methods, the proposed approach exhibits superior convergence accuracy, faster convergence efficiency, and lower computational complexity, with particularly significant advantages in large-scale problem scenarios.

       

    /

    返回文章
    返回