29,660 research outputs found
A Framework for Low Complexity Least-Squares Localization With High Accuracy
In this paper, a new framework is proposed for least-squares localization based on estimated ranges, coveringtime-difference-of-arrival (TDoA), time-of-arrival (ToA), and received signal strength (RSS) cases. The multidimensional nonlinear localization problem is first transformed to a lower dimension and then solved iteratively. Within the proposed transformed least-squares (TLS) framework, we introduce a method in which the localization problem is transformed to one dimension (1-D). In this way, compared to the classical nonlinear least-squares (NLS) type of methods, the amount of computations in each iteration is greatly reduced; a reduction of 67% for a 3-D positioning system is shown. Hence, the introduced 1-D iterative (1DI) method is fairly light on the computational load.The way to choose the 1-D parameter is proposed, and theoretical expressions for the convergence rate and the root- mean-squared error (RMSE) of the 1DI estimator are derived. Validation is performed mainly based on actual ultra-wideband (UWB) radio measurements, collected in typical office environments, with signal bandwidths varying from 0.5 to 7.5 GHz. Supplementary simulations are also included for validation. Results show that, in terms of RMSE, the 1DI method performs better than the linear least-squares (LLS) method, where the solution is obtained noniteratively, and performs similarly as NLS, especially in TDoA cases
Optimization Based Self-localization for IoT Wireless Sensor Networks
In this paper we propose an embedded optimization framework for the simultaneous self-localization of all sensors in wireless sensor networks making use of range measurements from ultra-wideband (UWB) signals. Low-power UWB radios, which provide time-of-arrival measurements with decimeter accuracy over large distances, have been increasingly envisioned for realtime localization of IoT devices in GPS-denied environments and large sensor networks. In this work, we therefore explore different non-linear least-squares optimization problems to formulate the localization task based on UWB range measurements. We solve the resulting optimization problems directly using non-linear-programming algorithms that guarantee convergence to locally optimal solutions. This optimization framework allows the consistent comparison of different optimization methods for sensor localization. We propose and demonstrate the best optimization approach for the self-localization of sensors equipped with off-the-shelf microcontrollers using state-of-the-art code generation techniques for the plug-and-play deployment of the optimal localization algorithm. Numerical results indicate that the proposed approach improves localization accuracy and decreases computation times relative to existing iterative methods
Robust Near-Field 3D Localization of an Unaligned Single-Coil Agent Using Unobtrusive Anchors
The magnetic near-field provides a suitable means for indoor localization,
due to its insensitivity to the environment and strong spatial gradients. We
consider indoor localization setups consisting of flat coils, allowing for
convenient integration of the agent coil into a mobile device (e.g., a smart
phone or wristband) and flush mounting of the anchor coils to walls. In order
to study such setups systematically, we first express the Cram\'er-Rao lower
bound (CRLB) on the position error for unknown orientation and evaluate its
distribution within a square room of variable size, using 15 x 10cm anchor
coils and a commercial NFC antenna at the agent. Thereby, we find cm-accuracy
being achievable in a room of 10 x 10 x 3 meters with 12 flat wall-mounted
anchors and with 10mW used for the generation of magnetic fields. Practically
achieving such estimation performance is, however, difficult because of the
non-convex 5D likelihood function. To that end, we propose a fast and accurate
weighted least squares (WLS) algorithm which is insensitive to initialization.
This is enabled by effectively eliminating the orientation nuisance parameter
in a rigorous fashion and scaling the individual anchor observations, leading
to a smoothed 3D cost function. Using WLS estimates to initialize a
maximum-likelihood (ML) solver yields accuracy near the theoretical limit in up
to 98% of cases, thus enabling robust indoor localization with unobtrusive
infrastructure, with a computational efficiency suitable for real-time
processing.Comment: 7 pages, to be presented at IEEE PIMRC 201
Emitter Location Finding using Particle Swarm Optimization
Using several spatially separated receivers, nowadays positioning techniques, which are implemented to determine the location of the transmitter, are often required for several important disciplines such as military, security, medical, and commercial applications. In this study, localization is carried out by particle swarm optimization using time difference of arrival. In order to increase the positioning accuracy, time difference of arrival averaging based two new methods are proposed. Results are compared with classical algorithms and Cramer-Rao lower bound which is the theoretical limit of the estimation error
Space-Time Hierarchical-Graph Based Cooperative Localization in Wireless Sensor Networks
It has been shown that cooperative localization is capable of improving both
the positioning accuracy and coverage in scenarios where the global positioning
system (GPS) has a poor performance. However, due to its potentially excessive
computational complexity, at the time of writing the application of cooperative
localization remains limited in practice. In this paper, we address the
efficient cooperative positioning problem in wireless sensor networks. A
space-time hierarchical-graph based scheme exhibiting fast convergence is
proposed for localizing the agent nodes. In contrast to conventional methods,
agent nodes are divided into different layers with the aid of the space-time
hierarchical-model and their positions are estimated gradually. In particular,
an information propagation rule is conceived upon considering the quality of
positional information. According to the rule, the information always
propagates from the upper layers to a certain lower layer and the message
passing process is further optimized at each layer. Hence, the potential error
propagation can be mitigated. Additionally, both position estimation and
position broadcasting are carried out by the sensor nodes. Furthermore, a
sensor activation mechanism is conceived, which is capable of significantly
reducing both the energy consumption and the network traffic overhead incurred
by the localization process. The analytical and numerical results provided
demonstrate the superiority of our space-time hierarchical-graph based
cooperative localization scheme over the benchmarking schemes considered.Comment: 14 pages, 15 figures, 4 tables, accepted to appear on IEEE
Transactions on Signal Processing, Sept. 201
Stable Camera Motion Estimation Using Convex Programming
We study the inverse problem of estimating n locations (up to
global scale, translation and negation) in from noisy measurements of a
subset of the (unsigned) pairwise lines that connect them, that is, from noisy
measurements of for some pairs (i,j) (where the
signs are unknown). This problem is at the core of the structure from motion
(SfM) problem in computer vision, where the 's represent camera locations
in . The noiseless version of the problem, with exact line measurements,
has been considered previously under the general title of parallel rigidity
theory, mainly in order to characterize the conditions for unique realization
of locations. For noisy pairwise line measurements, current methods tend to
produce spurious solutions that are clustered around a few locations. This
sensitivity of the location estimates is a well-known problem in SfM,
especially for large, irregular collections of images.
In this paper we introduce a semidefinite programming (SDP) formulation,
specially tailored to overcome the clustering phenomenon. We further identify
the implications of parallel rigidity theory for the location estimation
problem to be well-posed, and prove exact (in the noiseless case) and stable
location recovery results. We also formulate an alternating direction method to
solve the resulting semidefinite program, and provide a distributed version of
our formulation for large numbers of locations. Specifically for the camera
location estimation problem, we formulate a pairwise line estimation method
based on robust camera orientation and subspace estimation. Lastly, we
demonstrate the utility of our algorithm through experiments on real images.Comment: 40 pages, 12 figures, 6 tables; notation and some unclear parts
updated, some typos correcte
- …