The ability of robots to estimate their location is crucial for a wide variety of autonomous operations. In settings where GPS is unavailable, measurements of transmissions from fixed beacons provide an effective means of estimating a robot's location as it navigates. The accuracy of such a beacon-based localization system depends both on how beacons are distributed in the environment, and how the robot's location is inferred based on noisy and potentially ambiguous measurements. We propose an approach for making these design decisions automatically and without expert supervision, by explicitly searching for the placement and inference strategies that, together, are optimal for a given environment. Since this search is computationally expensive, our approach encodes beacon placement as a differential neural layer that interfaces with a neural network for inference. This formulation allows us to employ standard techniques for training neural networks to carry out the joint optimization. We evaluate this approach on a variety of environments and settings, and find that it is able to discover designs that enable high localization accuracy.
The above methods deal with optimal ways of inferring location given an existing network of beacons. The decision of how to distribute these beacons, however, is often made manually based on expert intuition. Automated placement methods are used rarely, and for very specific settings, such as RSS fingerprint-based localization @cite_21 . The most common of these is to ensure full coverage--- to ensure that all locations are within an acceptable range'' of at least one beacon, assuming this condition is sufficient to guarantee accurate localization.
@cite_21
2143565584 2343041401 2901105864 1976155457
The localization of sensor nodes is a fundamental problem in sensor networks and can be implemented using powerful and expensive beacons. Beacons, the fewer the better, can acquire their position knowledge either from GPS devices or by virtue of being manually placed. In this paper, we propose a distributed method to localization of sensor nodes using a single moving beacon, where sensor nodes compute their position estimate based on the range-free technique. Two parameters are critical to the location accuracy of sensor nodes: the radio transmission range of the beacon and how often the beacon broadcasts its position. Theoretical analysis shows that these two parameters determine the upper bound of the estimation error when the traverse route of the beacon is a straight line. We extend the position estimate when the traverse route of the beacon is randomly chosen in a real-world situation, where the radio irregularity might cause a node to miss some crucial coordinate information from the beacon. We further point out that the movement pattern of the beacon plays a pivotal role in the localization task for sensors. To minimize estimation errors, sensor nodes can carry out a variety of algorithms in accordance with the movement of the beacon. Simulation results compare variants of the distributed method in a variety of testing environments. Real experiments show that the proposed method is feasible and can estimate the location of sensor nodes accurately, given a single moving beacon. The Received Signal Strength (RSS) based fingerprinting approaches for indoor localization pose a need for updating the fingerprint databases due to dynamic nature of the indoor environment. This process is hectic and time-consuming when the size of the indoor area is large. The semi-supervised approaches reduce this workload and achieve good accuracy around 15 percent of the fingerprinting load but the performance is severely degraded if it is reduced below this level. We propose an indoor localization framework that uses unsupervised manifold alignment. It requires only 1 percent of the fingerprinting load, some crowd sourced readings, and plan coordinates of the indoor area. The 1 percent fingerprinting load is used only in perturbing the local geometries of the plan coordinates. The proposed framework achieves less than 5 m mean localization error, which is considerably better than semi-supervised approaches at very small amount of fingerprinting load. In addition, the few location estimations together with few fingerprints help to estimate the complete radio map of the indoor environment. The estimation of radio map does not demand extra workload rather it employs the already available information from the proposed indoor localization framework. The testing results for radio map estimation show almost 50 percent performance improvement by using this information as compared to using only fingerprints. This paper experimentally compares the positioning accuracy of TDoA-based and RSS-based localization in a public outdoor LoRa network in the Netherlands. The performance of different Received Signal Strength (RSS)-based approaches (proximity, centroid, map matching,…) is compared with Time-Difference-of-Arrival (TDoA) performance. The number of RSS and TDoA location updates and the positioning accuracy per spreading factor (SF) is assessed, allowing to select the optimal SF choice for the network. A road mapping filter is applied to the raw location estimates for the best algorithms and SFs. RSS-based approaches have median and maximal errors that are limited to 1000 m and 2000 m respectively, using a road mapping filter. Using the same filter, TDoA-based approaches deliver median and maximal errors in the order of 150 m and 350 m respectively. However, the number of location updates per time unit using SF7 is around 10 times higher for RSS algorithms than for the TDoA algorithm. In this paper, we consider the indoor localization problem, i.e., identifying the Cartesian coordinates of an object or a person under the roof. To solve this problem we consider an RF-based localization method called profiling , a two-step process, where a radio map of the monitored area is first constructed by collecting signal strength from known locations. An unknown location is then predicted using this radio map as a reference. In this paper, we first propose a K nearest neighbor (KNN) profiling-based localization method dubbed LEMON (location estimation by mining oversampled neighborhoods). It is based on a low-cost, low-power wireless devices and ensures good accuracy compared to the state-of-the-art. We then propose a variant of LEMON called combinatorial localization which exhaustively searches for the best possible set of nearest neighbors. We further define a Bayesian network model for the same localization problem. The performance of these methods is evaluated through extensive experiments in various indoor areas. We found an interesting outcome that the simple KNN-based approach can offer better localization accuracy compared to other complex localization methods. Thus we further enhance the performance of the KNN-based approach using multiple RF channels.