检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李海鹏[1,2] 冯大政[1] 周永伟[2] 董普靠[2] LI Haipeng;FENG Dazheng;ZHOU Yongwei;DONG Pukao(National Key Laboratory of Radar Signal Processing, Xidian University, Xi'an 710071, Shaanxi, China;Xi'an Electronic Engineering Research Institute, Xi'an 710100, Shaanxi, China)
机构地区:[1]西安电子科技大学雷达信号处理国家重点实验室,陕西西安710071 [2]西安电子工程研究所,陕西西安710100
出 处:《兵工学报》2021年第3期563-571,共9页Acta Armamentarii
基 金:国家自然科学基金项目(61971470)。
摘 要:针对多基地雷达组网布站的费效比高问题,提出一种基于最小化部署成本的布站优化方法。采用等宽栅栏的部署策略,以单条布置线的布站优化条件为基础建立优化模型。为求解优化模型,利用穷举算法对所有可能的栅栏宽度确定其布站优化参数,在计算总部署成本时,考虑发射站成本大于接收站的实际情况,以最小部署成本为目标函数确定最优部署成本和相应的布站参数。为降低算法计算量,通过理论证明缩减了穷举搜索的搜索范围。仿真结果表明,与现有同类方法相比,所提方法具有布站成本低、使用发射站少和计算量小的优势,在工程上更经济,在电子战中更安全。An optimization approach based on minimum deployment cost is proposed to solve the cost-effectiveness problem of deployment network for multistatic radar.The width equipartition barrier is adopted in the deployment strategy,and an optimal model is proposed based on the optimum condition of one deployment line.In order to solve the optimal model,the exhaustive algorithm is introduced to determine the deployment parameters for every possible barrier width.Considering that the unit cost of a transmitter is greater than that of a receiver,the optimum deployment cost and corresponding deployment parameters can be found by minimizing the deployment cost.To decrease the calculated amount of the algorithm,the search scope of exhaustive search is reduced by theoretical demonstration.Simulated results indicate that,compared with the existing similar approach,the proposed approach is used to reduce the deployment cost,usage quantity of transmitters and calculated mount,and make engineering more economical and keep safe in electronic warfare.
关 键 词:多基地雷达 布站优化 费效比 栅栏覆盖 部署成本
分 类 号:TN959.11[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.219.135