本文選題：無線傳感器網(wǎng)絡(luò) + 目標(biāo)定位��； 參考：《傳感技術(shù)學(xué)報(bào)》2017年09期

【摘要】：在無線傳感器網(wǎng)絡(luò)定位中,TDOA和AOA聯(lián)合定位可有效利用多種位置信息提高定位精度。由于傳統(tǒng)聯(lián)合加權(quán)最小二乘(WLS)的目標(biāo)函數(shù)非線性,在應(yīng)用于無線傳感器網(wǎng)絡(luò)定位時(shí),會(huì)產(chǎn)生多個(gè)局部最優(yōu)解。因此,針對(duì)該問題本文將約束加權(quán)最小二乘問題轉(zhuǎn)化為二次約束二次規(guī)劃問題,之后通過引入半定松弛(SDR)方法將聯(lián)合定位問題轉(zhuǎn)換為低復(fù)雜度的半定規(guī)劃問題(SDP),進(jìn)而尋找全局最優(yōu)解。并且針對(duì)實(shí)際應(yīng)用中參考節(jié)點(diǎn)帶誤差的情形分析和推導(dǎo)了定位算法。與已有算法相比,提出的算法在參考節(jié)點(diǎn)無誤差和有誤差時(shí)都有更高的精度。此外,提出的SDP算法還能夠?qū)崿F(xiàn)只有兩個(gè)參考節(jié)點(diǎn)下的目標(biāo)定位。
[Abstract]:In wireless sensor network positioning, the joint location of TDOA and AOA can effectively use a variety of location information to improve the positioning accuracy. Due to the nonlinear objective function of the traditional joint weighted least squares (WLS), multiple local optimal solutions will be produced when the wireless sensor network is located. Therefore, the constrained weighting is minimization in this paper. The two multiplicative problem is transformed into a two time constraint two order programming problem, and then a semi definite relaxation (SDR) method is introduced to transform the joint location problem into a low complexity semidefinite programming problem (SDP), and then the global optimal solution is found. And the location algorithm is analyzed and derived for the case of reference nodes with error in practical applications. The proposed algorithm has higher accuracy when the reference node has no error or error. In addition, the proposed SDP algorithm can also achieve the target location under only two reference nodes.

【作者單位】： 天津大學(xué)電氣自動(dòng)化與信息工程學(xué)院;天津大學(xué)微電子學(xué)院;
【基金】：國(guó)家自然科學(xué)基金項(xiàng)目(61501322)
【分類號(hào)】：TN929.5;TP212.9
，

本文編號(hào)：1879885