Semidefinite Relaxation Algorithm for Multisource Localization Using TDOA Measurements with Range Constraints

5Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Multiple sources localization based on time difference of arrival (TDOA) measurements is investigated in this paper. Different from the traditional methods, a novel and practical multisource localization algorithm is proposed by adopting a priori information of relative distance among emitting sources. Since the maximum likelihood (ML) cost function for multisource estimation is highly nonconvex, the semidefinite relaxation (SDR) is utilized to reformulate the ML cost function. A robust estimator is obtained, which can be solved by semidefinite programming (SDP). Moreover, the constrained Cramér-Rao bound is also derived as a benchmark by considering the range constraints between sources. Simulation results verify the superior performance of the proposed algorithm over the traditional methods.

Cite

CITATION STYLE

APA

Jia, C., Yin, J., Wang, D., Wang, Y., & Zhang, L. (2018). Semidefinite Relaxation Algorithm for Multisource Localization Using TDOA Measurements with Range Constraints. Wireless Communications and Mobile Computing, 2018. https://doi.org/10.1155/2018/9430180

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free