The University of Southampton
University of Southampton Institutional Repository

Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation

Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
One of the challenging problems in collaborative position localization arises when the distance measurements contain Non-Line-Of-Sight (NLOS) biases. Convex optimization has played a major role in modelling such problems and numerical algorithm developments. One of the successful examples is the Semi-Definite Programming (SDP), which translates Euclidean distances into the constraints of positive semidefinite matrices, leading to a large number of constraints in the case of NLOS biases. In this paper, we propose a new convex optimization model that is built upon the concept of Euclidean Distance Matrix (EDM). The resulting EDM optimization has an advantage that its Lagrangian dual problem is well structured and hence is conducive to algorithm developments. We apply a recently proposed $3$-block alternating direction method of multipliers to the dual problem and tested the algorithm on some real as well as simulated data of large scale. In particular, the EDM model significantly outperforms the existing SDP model and several others.
0926-6003
187-218
Ding, Chao
67300df2-ae66-48d2-89a4-c488d148aa4a
Qi, Hou-Duo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85
Ding, Chao
67300df2-ae66-48d2-89a4-c488d148aa4a
Qi, Hou-Duo
e9789eb9-c2bc-4b63-9acb-c7e753cc9a85

Ding, Chao and Qi, Hou-Duo (2017) Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation. Computational Optimization and Applications, 66 (1), 187-218. (doi:10.1007/s10589-016-9858-5).

Record type: Article

Abstract

One of the challenging problems in collaborative position localization arises when the distance measurements contain Non-Line-Of-Sight (NLOS) biases. Convex optimization has played a major role in modelling such problems and numerical algorithm developments. One of the successful examples is the Semi-Definite Programming (SDP), which translates Euclidean distances into the constraints of positive semidefinite matrices, leading to a large number of constraints in the case of NLOS biases. In this paper, we propose a new convex optimization model that is built upon the concept of Euclidean Distance Matrix (EDM). The resulting EDM optimization has an advantage that its Lagrangian dual problem is well structured and hence is conducive to algorithm developments. We apply a recently proposed $3$-block alternating direction method of multipliers to the dual problem and tested the algorithm on some real as well as simulated data of large scale. In particular, the EDM model significantly outperforms the existing SDP model and several others.

Text
NLOS_Revised.pdf - Accepted Manuscript
Download (4MB)

More information

Accepted/In Press date: 11 June 2016
e-pub ahead of print date: 22 June 2016
Published date: January 2017
Organisations: Operational Research

Identifiers

Local EPrints ID: 396745
URI: http://eprints.soton.ac.uk/id/eprint/396745
ISSN: 0926-6003
PURE UUID: e659fa5d-84ba-402e-89a0-20699b99d7ed
ORCID for Hou-Duo Qi: ORCID iD orcid.org/0000-0003-3481-4814

Catalogue record

Date deposited: 14 Jun 2016 08:11
Last modified: 15 Mar 2024 05:39

Export record

Altmetrics

Contributors

Author: Chao Ding
Author: Hou-Duo Qi ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×