Simple and Fast Convex Relaxation Method for Cooperative Localization in Sensor Networks Using Range Measurements
From MaRDI portal
Publication:4580767
DOI10.1109/TSP.2015.2454853zbMATH Open1394.94546DBLPjournals/tsp/SoaresXG15arXiv1408.4728WikidataQ59236793 ScholiaQ59236793MaRDI QIDQ4580767FDOQ4580767
Author name not available (Why is that?)
Publication date: 22 August 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1408.4728
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
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
- Title not available (Why is that?)
- 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)
