Polynomial-time approximation algorithms for anchor-free TDoA localization

DOI10.1016/J.TCS.2014.04.007MaRDI QIDQ742410zbMATH OpenOpenAlexFDO

Authors Johannes Wendeberg, Christian Schindelhauer

Publication date 18 September 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2014.04.007

zbMATH Keywords

approximationFPTASlocalizationTDoA

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Recommendations

• Minimal solvers for unsynchronized TDOA sensor network calibration
• Self-localization based on ambient signals
• A comprehensive analysis of the geometry of TDOA maps in localization problems
• A robust TDOA-based location method and its performance analysis
• A self-localization method for wireless sensor networks

Cites work

• A self-localization method for wireless sensor networks
• A tree-search algorithm for mixed integer programming problems
• Algorithms for sensor systems. 6th international workshop on algorithms for sensor systems, wireless ad hoc networks, and autonomous mobile entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010. Revised selected papers
• An Automatic Method of Solving Discrete Programming Problems
• Branch-and-Bound Methods: A Survey
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• Some branch and bound techniques for nonlinear optimization

Cited in

(2)

• Minimal solvers for unsynchronized TDOA sensor network calibration
• Robust Convex Approximation Methods for TDOA-Based Localization Under NLOS Conditions

This page was built for publication: Polynomial-time approximation algorithms for anchor-free TDoA localization

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