645 research outputs found
Robust Component-based Network Localization with Noisy Range Measurements
Accurate and robust localization is crucial for wireless ad-hoc and sensor
networks. Among the localization techniques, component-based methods advance
themselves for conquering network sparseness and anchor sparseness. But
component-based methods are sensitive to ranging noises, which may cause a huge
accumulated error either in component realization or merging process. This
paper presents three results for robust component-based localization under
ranging noises. (1) For a rigid graph component, a novel method is proposed to
evaluate the graph's possible number of flip ambiguities under noises. In
particular, graph's \emph{MInimal sepaRators that are neaRly cOllineaR
(MIRROR)} is presented as the cause of flip ambiguity, and the number of
MIRRORs indicates the possible number of flip ambiguities under noise. (2) Then
the sensitivity of a graph's local deforming regarding ranging noises is
investigated by perturbation analysis. A novel Ranging Sensitivity Matrix (RSM)
is proposed to estimate the node location perturbations due to ranging noises.
(3) By evaluating component robustness via the flipping and the local deforming
risks, a Robust Component Generation and Realization (RCGR) algorithm is
developed, which generates components based on the robustness metrics. RCGR was
evaluated by simulations, which showed much better noise resistance and
locating accuracy improvements than state-of-the-art of component-based
localization algorithms.Comment: 9 pages, 15 figures, ICCCN 2018, Hangzhou, Chin
A Localization Method Avoiding Flip Ambiguities for micro-UAVs with Bounded Distance Measurement Errors
Localization is a fundamental function in cooperative control of micro
unmanned aerial vehicles (UAVs), but is easily affected by flip ambiguities
because of measurement errors and flying motions. This study proposes a
localization method that can avoid the occurrence of flip ambiguities in
bounded distance measurement errors and constrained flying motions; to
demonstrate its efficacy, the method is implemented on bilateration and
trilateration. For bilateration, an improved bi-boundary model based on the
unit disk graph model is created to compensate for the shortage of distance
constraints, and two boundaries are estimated as the communication range
constraint. The characteristic of the intersections of the communication range
and distance constraints is studied to present a unique localization criterion
which can avoid the occurrence of flip ambiguities. Similarly, for
trilateration, another unique localization criterion for avoiding flip
ambiguities is proposed according to the characteristic of the intersections of
three distance constraints. The theoretical proof shows that these proposed
criteria are correct. A localization algorithm is constructed based on these
two criteria. The algorithm is validated using simulations for different
scenarios and parameters, and the proposed method is shown to provide excellent
localization performance in terms of average estimated error. Our code can be
found at: https://github.com/QingbeiGuo/AFALA.git.Comment: 14 pages, 8 figures, IEEE Transactions on Mobile Computing(Accepted
Anchor Self-Calibrating Schemes for UWB based Indoor Localization
Traditional indoor localization techniques that use Received Signal Strength or Inertial Measurement Units for dead-reckoning suffer from signal attenuation and sensor drift, resulting in inaccurate position estimates. Newly available Ultra-Wideband radio modules can measure distances at a centimeter-level accuracy while mitigating the effects of multipath propagation due to their very fine time resolution. Known locations of fixed anchor nodes are required to determine the position of tag nodes within an indoor environment. For a large system consisting of several anchor nodes spanning a wide area, physically mapping out the locations of each anchor node is a tedious task and thus makes the scalability of such systems difficult. Hence it is important to develop indoor localization systems wherein the anchors can self-calibrate by determining their relative positions in Euclidean 3D space with respect to each other. In this thesis, we propose two novel anchor self-calibrating algorithms - Triangle Reconstruction Algorithm (TRA) and Channel Impulse Response Positioning (CIRPos) that improve upon existing range-based implementations and solve existing problems such as flip ambiguity and node localization success rate. The localization accuracy and scalability of the self-calibrating anchor schemes are tested in a simulated environment based on the ranging accuracy of the Ultra-Wideband modules
Cooperative Relative Positioning of Mobile Users by Fusing IMU Inertial and UWB Ranging Information
Relative positioning between multiple mobile users is essential for many
applications, such as search and rescue in disaster areas or human social
interaction. Inertial-measurement unit (IMU) is promising to determine the
change of position over short periods of time, but it is very sensitive to
error accumulation over long term run. By equipping the mobile users with
ranging unit, e.g. ultra-wideband (UWB), it is possible to achieve accurate
relative positioning by trilateration-based approaches. As compared to vision
or laser-based sensors, the UWB does not need to be with in line-of-sight and
provides accurate distance estimation. However, UWB does not provide any
bearing information and the communication range is limited, thus UWB alone
cannot determine the user location without any ambiguity. In this paper, we
propose an approach to combine IMU inertial and UWB ranging measurement for
relative positioning between multiple mobile users without the knowledge of the
infrastructure. We incorporate the UWB and the IMU measurement into a
probabilistic-based framework, which allows to cooperatively position a group
of mobile users and recover from positioning failures. We have conducted
extensive experiments to demonstrate the benefits of incorporating IMU inertial
and UWB ranging measurements.Comment: accepted by ICRA 201
Robust distribution sensor network localization with noisy range measurements
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.Includes bibliographical references (p. 73-74).This thesis describes a distributed, linear-time algorithm for localizing sensor network nodes in the presence of range measurement noise and demonstrates the algorithm on a physical network. We introduce the probabilistic notion of robust quadrilaterals as a way to avoid flip ambiguities that otherwise corrupt localization computations. We formulate the localization problem as a two-dimensional graph realization problem: given a planar graph with approximately known edge lengths, recover the Euclidean position of each vertex up to a global rotation and translation. This formulation is applicable to the localization of sensor networks in which each node can estimate the distance to each of its neighbors, but no absolute position reference such as GPS or fixed anchor nodes is available. We implemented the algorithm on a physical sensor network and empirically assessed its accuracy and performance. Also, in simulation, we demonstrate that the algorithm scales to large networks and handles real-world deployment geometries. Finally, we show how the algorithm supports localization of mobile nodes.by David Christopher Moore.S.M
- …