Localisation algorithm based on weighted semi-definite programming
by Jianfeng Lu; Xuanyuan Yang
International Journal of Embedded Systems (IJES), Vol. 13, No. 3, 2020

Abstract: In order to improve the performance of reduced complexity positive semi-definite programming (RCSDP) algorithm based on time difference of arrival (TDOA), a weighted positive semi-definite programming (WSDP) scheme is proposed in this paper. Based on the squared distance differences between the target node to one anchor node and to the other anchor node, the location of the target node is described as the optimal solution of a non-convex optimisation problem. The semi-definite relaxation technique is used to transform the original non-convex problem into a weighted convex problem, which takes the measurement noise into consideration, and then the estimated location of the target node is obtained. The simulation results show that the localisation performance of WSDP algorithm is better than that of RCSDP algorithm, regardless of whether the target node is located inside or outside the area surrounded by anchor nodes.

Online publication date: Wed, 30-Sep-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com