传统到达角度(Angle-Of-Arrival,AOA)/接受信号强度指示(Received Signal Strength Indicator,RSSI)混合定位往往需要多个锚节点布设阵列天线以实现高精度定位,为解决在锚节点资源受限下精度较低的问题,提出了一种基于Mesh网络的混合AOA...传统到达角度(Angle-Of-Arrival,AOA)/接受信号强度指示(Received Signal Strength Indicator,RSSI)混合定位往往需要多个锚节点布设阵列天线以实现高精度定位,为解决在锚节点资源受限下精度较低的问题,提出了一种基于Mesh网络的混合AOA/RSSI协作定位方法。仅有中心主锚节点提供AOA角度的情况下,采取最小二乘法对联合真实和虚拟锚节点所对应角度和距离信息进行初步定位;利用未知节点之间的协作通信和测距信息,位置估计问题被转换为无约束非线性优化问题,给予短距离链路更高权重,通过迭代求解最终实现协作定位。仿真结果表明,所提算法在锚节点资源受限情况下有效地提升了定位精度。展开更多
Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS met...Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991), a class of new restarting conjugate gradient methods is presented. Global convergences of the new method with two kinds of common line searches, are proved. Firstly, it is shown that, using reverse modulus of continuity function and forcing function, the new method for solving unconstrained optimization can work for a continously dif ferentiable function with Curry-Altman's step size rule and a bounded level set. Secondly, by using comparing technique, some general convergence properties of the new method with other kind of step size rule are established. Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.展开更多
文摘传统到达角度(Angle-Of-Arrival,AOA)/接受信号强度指示(Received Signal Strength Indicator,RSSI)混合定位往往需要多个锚节点布设阵列天线以实现高精度定位,为解决在锚节点资源受限下精度较低的问题,提出了一种基于Mesh网络的混合AOA/RSSI协作定位方法。仅有中心主锚节点提供AOA角度的情况下,采取最小二乘法对联合真实和虚拟锚节点所对应角度和距离信息进行初步定位;利用未知节点之间的协作通信和测距信息,位置估计问题被转换为无约束非线性优化问题,给予短距离链路更高权重,通过迭代求解最终实现协作定位。仿真结果表明,所提算法在锚节点资源受限情况下有效地提升了定位精度。
文摘Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991), a class of new restarting conjugate gradient methods is presented. Global convergences of the new method with two kinds of common line searches, are proved. Firstly, it is shown that, using reverse modulus of continuity function and forcing function, the new method for solving unconstrained optimization can work for a continously dif ferentiable function with Curry-Altman's step size rule and a bounded level set. Secondly, by using comparing technique, some general convergence properties of the new method with other kind of step size rule are established. Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.
