TY - JOUR
T1 - Single Sensor Path Design for Best Emitter Localization via Convex Optimization
AU - Tzoreff, Elad
AU - Weiss, Anthony J.
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2017/2
Y1 - 2017/2
N2 - We consider the design of a single moving sensor trajectory for the purpose of optimally localizing a stationary emitter based on time-of-arrival measurements, which are deteriorated by oscillator instability. The localization error covariance matrix is predicted by the Cramér-Rao bound. In order to optimize the localization, we propose the minimization of the largest eigenvalue of the bound matrix, or, equivalently, the maximization of the smallest eigenvalue of the associated Fisher information matrix. Two different cases are discussed. In the first case, a pre-mission path design is considered where the path is optimized for locating an emitter in the vicinity of a postulated location. In the second case, the path is designed in real time, as the sensor moves, using measurements collected online. Using robust optimization methods, the best next way-point is chosen, considering the uncertainty in the emitter location. Constraints rising from speed and maneuvering limitations, and restricted regions are treated. Since these optimization problems are non-convex, we use semi-definite relaxation. We demonstrate that in many scenarios, the proposed algorithms yield near optimal results.
AB - We consider the design of a single moving sensor trajectory for the purpose of optimally localizing a stationary emitter based on time-of-arrival measurements, which are deteriorated by oscillator instability. The localization error covariance matrix is predicted by the Cramér-Rao bound. In order to optimize the localization, we propose the minimization of the largest eigenvalue of the bound matrix, or, equivalently, the maximization of the smallest eigenvalue of the associated Fisher information matrix. Two different cases are discussed. In the first case, a pre-mission path design is considered where the path is optimized for locating an emitter in the vicinity of a postulated location. In the second case, the path is designed in real time, as the sensor moves, using measurements collected online. Using robust optimization methods, the best next way-point is chosen, considering the uncertainty in the emitter location. Constraints rising from speed and maneuvering limitations, and restricted regions are treated. Since these optimization problems are non-convex, we use semi-definite relaxation. We demonstrate that in many scenarios, the proposed algorithms yield near optimal results.
KW - Convex optimization
KW - Cramér-Rao lower bound
KW - Geolocation
KW - Semi-definite programming (SDP)
KW - Semi-definite relaxation (SDR)
KW - Time of arrival (TOA)
UR - http://www.scopus.com/inward/record.url?scp=85014970572&partnerID=8YFLogxK
U2 - 10.1109/TWC.2016.2635123
DO - 10.1109/TWC.2016.2635123
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85014970572
SN - 1536-1276
VL - 16
SP - 939
EP - 951
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 2
M1 - 7765131
ER -