检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曹俊[1,2] 郑翠娥[1,2] 孙大军[1,2] 张殿伦[1,2]
机构地区:[1]哈尔滨工程大学水声工程学院,黑龙江哈尔滨150001 [2]哈尔滨工程大学水声技术重点实验室,黑龙江哈尔滨150001
出 处:《兵工学报》2017年第3期520-526,共7页Acta Armamentarii
基 金:国家自然科学基金项目(61531012);国家国防科技工业局技术基础科研项目(B2420133002)
摘 要:基于单信标测距的定位方法,是水声定位技术一个新的研究方向,具有重要应用价值。针对单信标测距定位问题最小二乘结构,对高度非凸的测距定位方程首次提出了基于凸优化的解算方法。对带有误差的测距量测方程添加不等式约束条件,将其改写为有约束的解算方程;对目标函数和约束条件进行放射近似,将其进行凸化处理;引入松弛变量和罚函数,降低对迭代初值的敏感度。仿真结果表明:对于不同量级的初值误差,定位结果的差别在厘米量级,所提算法不需要可靠的初值即能迭代收敛得到高精度的定位结果;信标与圆形航迹的圆心距离越近,定位精度越高。通过湖上试验,进一步验证了所提算法的有效性。The localization method based on single beacon ranging is a new research direction of underwa- ter 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 con- strained solution equation. ~Fhe 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.
关 键 词:信息处理技术 单信标测距 虚拟信标 凸优化 约束条件 罚函数
分 类 号:TB568[交通运输工程—水声工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.139.108.138