首页 | 本学科首页   官方微博 | 高级检索  
     

基于凸优化的水下载体定位研究
引用本文:曹俊,郑翠娥,孙大军,张殿伦.基于凸优化的水下载体定位研究[J].兵工学报,2017,38(3):520-526.
作者姓名:曹俊  郑翠娥  孙大军  张殿伦
作者单位:哈尔滨工程大学水声工程学院,黑龙江哈尔滨150001;哈尔滨工程大学水声技术重点实验室,黑龙江哈尔滨150001;哈尔滨工程大学水声工程学院,黑龙江哈尔滨150001;哈尔滨工程大学水声技术重点实验室,黑龙江哈尔滨150001;哈尔滨工程大学水声工程学院,黑龙江哈尔滨150001;哈尔滨工程大学水声技术重点实验室,黑龙江哈尔滨150001;哈尔滨工程大学水声工程学院,黑龙江哈尔滨150001;哈尔滨工程大学水声技术重点实验室,黑龙江哈尔滨150001
基金项目:国家自然科学基金项目,国家国防科技工业局技术基础科研项目
摘    要:基于单信标测距的定位方法,是水声定位技术一个新的研究方向,具有重要应用价值。针对单信标测距定位问题最小二乘结构,对高度非凸的测距定位方程首次提出了基于凸优化的解算方法。对带有误差的测距量测方程添加不等式约束条件,将其改写为有约束的解算方程;对目标函数和约束条件进行放射近似,将其进行凸化处理;引入松弛变量和罚函数,降低对迭代初值的敏感度。仿真结果表明:对于不同量级的初值误差,定位结果的差别在厘米量级,所提算法不需要可靠的初值即能迭代收敛得到高精度的定位结果;信标与圆形航迹的圆心距离越近,定位精度越高。通过湖上试验,进一步验证了所提算法的有效性。

关 键 词:信息处理技术  单信标测距  虚拟信标  凸优化  约束条件  罚函数

Research on the Positioning of Underwater Vehicle Based on Convex Optimization
CAO Jun,ZHENG Cui-e,SUN Da-jun,ZHANG Dian-lun.Research on the Positioning of Underwater Vehicle Based on Convex Optimization[J].Acta Armamentarii,2017,38(3):520-526.
Authors:CAO Jun  ZHENG Cui-e  SUN Da-jun  ZHANG Dian-lun
Affiliation:(1.College of Underwater Acoustic Engineering, Harbin Engineering University, Harbin 150001, Heilongjiang, China;2.Acoustic Science and Technology Laboratory, Harbin Engineering University, Harbin 150001, Heilongjiang, China)
Abstract:The localization method based on single beacon ranging is a new research direction of underwater acoustic positioning technology.A method based on convex optimization is proposed for the first time to solve the least square structure for the single beacon ranging and locating.An inequality constraint condition is added to the ranging equation with errors,and the ranging equation is reformulated as a constrained solution equation.The objective function and constraint condition are approximated by radiation,and the convex processing is carried out.The slack variable and penalty function are introduced to reduce the sensitivity of iteration initial value.Simulated results show that the difference of positioning results is in centimeter order of magnitude for different magnitudes of initial errors.The proposed algorithm can be iterated convergence to get high accuracy of the positioning results without reliable initial value.When the beacon is close the center distance of circular track,the positioning accuracy is higher.The effectiveness of the proposed algorithm is verified by experiments on the lake.
Keywords:information processing technology  single beacon ranging  virtual beacon  convex optimization  constraint condition  penalty function
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《兵工学报》浏览原始摘要信息
点击此处可从《兵工学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号