检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈涛[1] 王梦馨 黄湘松[1] CHEN Tao;WANG Mengxin;HUANG Xiangsong(College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China)
机构地区:[1]哈尔滨工程大学信息与通信工程学院,哈尔滨150001
出 处:《电子与信息学报》2018年第7期1591-1597,共7页Journal of Electronics & Information Technology
基 金:国家自然科学基金项目(61571146);中央高校基本科研业务费专项基金(HEUCFP201769)~~
摘 要:针对无源时差(TDOA)定位的非线性方程解算问题,论文使用一种名为樽海鞘群算法(SSA)的新的群体智能优化算法。首先,该算法采用一种新的群体更新模型,充分平衡迭代过程中的探索行为与开发行为,在保证搜索的全局性与个体的多样性的同时,改善了其他智能优化算法容易陷入局部极值的问题。其次,该算法控制参数很少,运算速度明显提高。该算法的收敛速度十分稳定,定位精度更高。仿真结果表明,樽海鞘群算法在3维时差定位中能够快速、稳定地收敛至目标位置,对传统粒子群算法(PSO)、改进的线性权重粒子群算法(IPSO)与SSA的定位精度进行比较,SSA精度明显高于PSO与IPSO。To solve the nonlinear equation problems of Time-Difference-Of-Arrival (TDOA) passive location, a new swarm intelligence optimization algorithm called Salp-Swarm-Algorithm (SSA) is used. Firstly, a new renewal model of salps is proposed to balance exploration and exploitation properly during iteration in SSA. SSA not only ensures the wholeness of searching and the diversity of individuals, but also improves the problem that other intelligent optimization algorithms fall into local optima easily. Besides, there are few parameters to be adjusted, therefor, the computation speed is obviously improved. Moreover, the convergence performance of the proposed algorithm is very stable and the accuracy of location is higher. Simulation results show that the proposed algorithm can converge to the position of emitters fast and stably in 3D TDOA location. Comparing with Particle-Swarm- Optimization (PSO) and Improved-Particle-Swarm-Optimization (IPSO), the proposed algorithm has lower mean square error.
分 类 号:TN971[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.210