Efficient Convex Relaxation Methods for Robust Target Localization by a Sensor Network Using Time Differences of Arrivals
From MaRDI portal
Publication:4569762
Recommendations
- Simple and Fast Convex Relaxation Method for Cooperative Localization in Sensor Networks Using Range Measurements
- Robust Convex Approximation Methods for TDOA-Based Localization Under NLOS Conditions
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- scientific article; zbMATH DE number 6896614
- Conditions for correct sensor network localization using SDP relaxation
- Robust Localization of Nodes and Time-Recursive Tracking in Sensor Networks Using Noisy Range Measurements
- Time-Difference-of-Arrival (TDOA)-Based Distributed Target Localization by A Robotic Network
- Multitarget Simultaneous Localization and Mapping of a Sensor Network
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Comparing SOS and SDP relaxations of sensor network localization
Cited in
(6)- Robust Convex Approximation Methods for TDOA-Based Localization Under NLOS Conditions
- Source localization and denoising: a perspective from the TDOA space
- On the statistical model of source localization based on range difference measurements
- scientific article; zbMATH DE number 6896614 (Why is no real title available?)
- Efficient iteratively reweighted algorithms for robust hyperbolic localization
- Source localization using TDOA and FDOA measurements based on semidefinite programming and reformulation linearization
This page was built for publication: Efficient Convex Relaxation Methods for Robust Target Localization by a Sensor Network Using Time Differences of Arrivals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569762)