6,748 research outputs found
Look, no Beacons! Optimal All-in-One EchoSLAM
We study the problem of simultaneously reconstructing a polygonal room and a
trajectory of a device equipped with a (nearly) collocated omnidirectional
source and receiver. The device measures arrival times of echoes of pulses
emitted by the source and picked up by the receiver. No prior knowledge about
the device's trajectory is required. Most existing approaches addressing this
problem assume multiple sources or receivers, or they assume that some of these
are static, serving as beacons. Unlike earlier approaches, we take into account
the measurement noise and various constraints on the geometry by formulating
the solution as a minimizer of a cost function similar to \emph{stress} in
multidimensional scaling. We study uniqueness of the reconstruction from
first-order echoes, and we show that in addition to the usual invariance to
rigid motions, new ambiguities arise for important classes of rooms and
trajectories. We support our theoretical developments with a number of
numerical experiments.Comment: 5 pages, 6 figures, submitted to Asilomar Conference on Signals,
Systems, and Computers Websit
Design and realization of precise indoor localization mechanism for Wi-Fi devices
Despite the abundant literature in the field, there is still the need to find a time-efficient, highly accurate, easy to deploy and robust localization algorithm for real use. The algorithm only involves minimal human intervention. We propose an enhanced Received Signal Strength Indicator (RSSI) based positioning algorithm for Wi-Fi capable devices, called the Dynamic Weighted Evolution for Location Tracking (DWELT). Due to the multiple phenomena affecting the propagation of radio signals, RSSI measurements show fluctuations that hinder the utilization of straightforward positioning mechanisms from widely known propagation loss models. Instead, DWELT uses data processing of raw RSSI values and applies a weighted posterior-probabilistic evolution for quick convergence of localization and tracking. In this paper, we present the first implementation of DWELT, intended for 1D location (applicable to tunnels or corridors), and the first step towards a more generic implementation. Simulations and experiments show an accuracy of 1m in more than 81% of the cases, and less than 2m in the 95%.Peer ReviewedPostprint (published version
Graph Optimization Approach to Range-based Localization
In this paper, we propose a general graph optimization based framework for
localization, which can accommodate different types of measurements with
varying measurement time intervals. Special emphasis will be on range-based
localization. Range and trajectory smoothness constraints are constructed in a
position graph, then the robot trajectory over a sliding window is estimated by
a graph based optimization algorithm. Moreover, convergence analysis of the
algorithm is provided, and the effects of the number of iterations and window
size in the optimization on the localization accuracy are analyzed. Extensive
experiments on quadcopter under a variety of scenarios verify the effectiveness
of the proposed algorithm and demonstrate a much higher localization accuracy
than the existing range-based localization methods, especially in the altitude
direction
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks
We propose two novel algorithms for distributed and location-free boundary
recognition in wireless sensor networks. Both approaches enable a node to
decide autonomously whether it is a boundary node, based solely on connectivity
information of a small neighborhood. This makes our algorithms highly
applicable for dynamic networks where nodes can move or become inoperative.
We compare our algorithms qualitatively and quantitatively with several
previous approaches. In extensive simulations, we consider various models and
scenarios. Although our algorithms use less information than most other
approaches, they produce significantly better results. They are very robust
against variations in node degree and do not rely on simplified assumptions of
the communication model. Moreover, they are much easier to implement on real
sensor nodes than most existing approaches.Comment: extended version of accepted submission to SEA 201
- …