.png){kind=icon}
.png){kind=icon}
Return
Rank-One Semidefinite Programming Solutions for Mobile Source Localization in Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TNSE.2020.3047824.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we introduce a rank-one Semi-Definite Programming (SDP) solution method for mobile source localization in sensor networks. The position and velocity of mobile source are jointly estimated using Time Delay (TD) measurements. To obtain the position and velocity of mobile source, a Relaxed Semi-Definite Programming (RSDP) algorithm is firstly designed by dropping the rank-one constraint. However, dropping the rank-one constraint leads to produce a suboptimal solution. To improve the performance, we further put forward the Penalty Function Semi-Definite Programming (PF-SDP) method to obtain the rank-one solution of the estimation problem by introducing the penalty terms. By adaptively choosing the penalty coefficient, an Adaptive Penalty Function Semi-Definite Programming (APF-SDP) algorithm is also proposed to avoid the excessive penalty. We also conduct experiments in both a simulated environment and a real system to demonstrate the effectiveness of the proposed methods. The results have demonstrated that the proposed APF-SDP outperforms the PF-SDP in terms of the position and velocity estimation whether the noise level is large or not.
Keywords:
Programming
Position measurement
Relaxation methods
Delay effects
Velocity measurement
Time measurement
Optimization
Mobile source localization
rank-one solution
semidefinite programming
sensor networks
time delay
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
7.9
Papers:
2.5K
Citations:
10.0K
