基于REINFORCE算法的组网测向选站方法OA
A Station Selection Method for Networked Direction-Finding Based on the REINFORCE Algorithm
针对传统组网测向方法应对高速移动、短时出联目标信号时,存在时效性差、难以实时跟监的问题,提出一种基于REINFORCE算法的组网测向选站方法.采用马尔可夫决策过程(Mar-kov Decision Process,MDP)框架,将站点组合过程分解为多步决策过程,通过逐次选取站点来构建组合,实现组合优化问题到序贯决策问题的转化;同时,以站点与目标的位置关系作为状态空间,用选站组合数量约束智能体的学习步数,对已选择的站点进行动作屏蔽,并利用几何精度因子(Geometrical Dilution of Precision,GDOP)作为奖惩函数评价选站方案的优劣.实验结果表明,该方法在时间复杂度上显著优于遍历方法与遗传算法,在定位精度上与遍历方法基本持平,在泛化能力上,能够学习到测向站空间构型与GDOP之间的映射关系,对于未训练的目标场景也可以完成组网方案决策.
To address the issue of the poor timeliness and difficulty of real-time tracking in traditional networked direction-finding methods when handling fast-moving targets with short signal burst dura-tions,a station selection method based on the REINFORCE algorithm is proposed.A Markov decision process(MDP)framework is employed to decompose the station combination process into a multi-step sequential decision process.By selecting stations one by one,the combinatorial optimization problem is transformed into a sequential decision problem.The positional relationship between stations and the target is used as the state space,the number of stations in the combination constrains the agent's learn-ing steps,action masking is applied to the selected stations,and the geometrical dilution of precision(GDOP)serves as the reward function to evaluate the quality of station selection schemes.Experimen-tal results demonstrate that the proposed method significantly outperforms both the exhaustive method and the genetic algorithm in terms of time complexity,while achieving comparable localization accu-racy to the exhaustive method.Furthermore,it exhibits strong generalization ability by learning the mapping between station spatial configuration and GDOP,enabling effective network deployment deci-sions for unseen target scenarios.
朱晨晨;张静
信息工程大学,河南 郑州 450001信息工程大学,河南 郑州 450001
信息技术与安全科学
组网测向序贯决策强化学习动作屏蔽几何精度因子
networked direction-findingsequential decisionreinforcement learningaction maskinggeometric dilution of precision
《信息工程大学学报》 2026 (3)
291-296,303,7
评论