Simple and Fast Convex Relaxation Method for Cooperative Localization in Sensor Networks Using Range Measurements

DOI10.1109/TSP.2015.2454853MaRDI QIDQ4580767zbMATH OpenDBLPWikidataFDO

Authors

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.4728

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: We address the sensor network localization problem given noisy range measurements between pairs of nodes. We approach the non-convex maximum-likelihood formulation via a known simple convex relaxation. We exploit its favorable optimization properties to the full to obtain an approach that: is completely distributed, has a simple implementation at each node, and capitalizes on an optimal gradient method to attain fast convergence. We offer a parallel but also an asynchronous flavor, both with theoretical convergence guarantees and iteration complexity analysis. Experimental results establish leading performance. Our algorithms top the accuracy of a comparable state of the art method by one order of magnitude, using one order of magnitude fewer communications.

Cited in

(5)

• Linear convergence of distributed estimation with constraints and communication delays
• Efficient Convex Relaxation Methods for Robust Target Localization by a Sensor Network Using Time Differences of Arrivals
• scientific article; zbMATH DE number 6896614 (Why is no real title available?)
• On Using the Relative Configuration to Explore Cooperative Localization
• Robust Euclidean embedding via EDM optimization

This page was built for publication: Simple and Fast Convex Relaxation Method for Cooperative Localization in Sensor Networks Using Range Measurements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580767)