动态任务下可自适应终止的MIMO雷达站点优化配置算法

    An Adaptive TerminationMethodfor MIMO RadarAntenna DeploymentAlgorithm in Dynamic Environment

    • 摘要: 针对动态任务下MIMO雷达多区域连续监视任务中基于预测的粒子群优化算法(PBPSO)的迭代寻优次数难以预先确定、计算资源利用率不高的问题,本文提出一种面向PBPSO迭代寻优的自适应终止方法。首先,以多个监视区域的有效覆盖率为优化目标,阐述动态任务下MIMO雷达站点优化配置问题的动态多目标优化建模方法及其对应的PBPSO求解算法。其次,分别构造表征非劣解集收敛程度和多样性的评价指标,进一步地,为缓解收敛程度在迭代过程中出现的波动现象,引入卡尔曼滤波思想对其进行平滑处理,以提高收敛判定的稳定性,并在此基础上建立算法自适应停止准则。最后,通过仿真实验验证了所提方法相较于固定最大迭代次数的PBPSO算法的优越性。

       

      Abstract: To address the problems that the number of iterations for the prediction-based particle swarm optimization (PBPSO) algorithm is difficult to predefine and computational resource utilization is inefficient in multi-region surveillance tasks of MIMO radar in dynamic environments, this paper proposes an adaptive termination method for PBPSO iterative optimization. Firstly, with the effective coverage rate of multiple surveillance regions as the optimization objective, the dynamic multi-objective optimization model for MIMO radar site configuration and the corresponding PBPSO algorithm are elaborated. Then, evaluation metrics characterizing the convergence and diversity of the non-dominated solution set are constructed respectively. Furthermore, to mitigate fluctuations in the convergence degree during iteration, Kalman filtering theory is adopted for smoothing to improve the stability of convergence judgment, and the adaptive stopping criterion of the algorithm is established accordingly. Finally, simulation results verify the superiority of the proposed method over traditional algorithms.

       

    /

    返回文章
    返回