Semidefinite Programming Approach for Range-Difference Based Source Localization

TLDR: A semidefinite relaxation RD-based positioning algorithm, which makes use of the admissible source position information, is proposed and its estimation performance is contrasted with the two-step weighted least squares method and nonlinear least squares estimator as well as Cramer-Rao lower bound.

Abstract: A common technique for passive source localization is to utilize the range-difference (RD) measurements between the source and several spatially separated sensors. The RD information defines a set of hyperbolic equations from which the source position can be calculated with the knowledge of the sensor positions. Under the standard assumption of Gaussian distributed RD measurement errors, it is well known that the maximum-likelihood (ML) position estimation is achieved by minimizing a multimodal cost function which corresponds to a difficult task. In this correspondence, we propose to approximate the nonconvex ML optimization by relaxing it to a convex optimization problem using semidefinite programming. A semidefinite relaxation RD-based positioning algorithm, which makes use of the admissible source position information, is proposed and its estimation performance is contrasted with the two-step weighted least squares method and nonlinear least squares estimator as well as Cramer-Rao lower bound.