Low Complexity Short Baseline Localization Algorithm Based on Taylor Expansion

Author(s):  
Xiaoyan You ◽  
Yanbo Wu ◽  
Min Zhu ◽  
Xinguo Li ◽  
Linyuan Zhang
2007 ◽  
Vol 04 (01) ◽  
pp. 77-89 ◽  
Author(s):  
WANMING CHEN ◽  
HUAWEI LIANG ◽  
TAO MEI ◽  
ZHUHONG YOU ◽  
SHIFU MIAO ◽  
...  

Global Positioning System (GPS) is often used as a main information source for robot localization and navigation. However, it cannot be used in room or in field complex environment because of the bad signal there. To solve this problem, the authors designed and implemented a specific wireless sensor network (WSN) to provide information about the environment and indicate path for robot navigation. A two-stage auto-adaptive route selecting mechanism of the WSN was proposed to facilitate data relaying in localization and the robot's navigation. A low complexity localization algorithm was used to localize both the nodes and the robot. An indirect communication method was designed to make the communication between the WSN and the robot possible. In addition, a robot navigation method was proposed based on the wireless sensor network. In this method, the robot did not need to obtain the environment information; the wireless sensor nodes collected and fused the distributed information and then indicate a path for the robot. Experiments showed that the wireless sensor network can result in obstacle avoidance navigation, and can implement the online navigation.


2014 ◽  
Vol 538 ◽  
pp. 502-507
Author(s):  
Jiang Shan Ai ◽  
Xiao Hong Chen

For accomplishing acoustic location in wireless sensor networks (WSNs), a range free acoustic localization algorithm based on perpendicular bisector partition is proposed, taking into account of reducing computation complexity and reduce the interference of the background noise. Adopting a range free perpendicular bisector partition, the proposed method can find the sub-region of the source, and the time complexity is much lower than that of existing methods. According to extensive analysis on noise, the concept of noise sensitive region is derived. Experimental results show that the proposed method has a high localization precision and low complexity.


2014 ◽  
Vol 1049-1050 ◽  
pp. 2144-2148
Author(s):  
Ran Ran Li ◽  
Lei Li ◽  
Xiao Hui Li

Min-Max localization algorithm is usually used to acquire the position of a sensor node in wireless sensor networks by the reason of its simpleness and low complexity. However, Min-Max algorithm provides a coarse position estimation. In order to increase its accuracy, an Extended Min-Max (E-Min-Max) algorithm has been proposed. In this paper we focus on this algorithm and propose an improved E-Min-Max algorithm to enhance its accuracy further. Simulations show that the improved E-Min-Max algorithm outperforms its original version in localization.


Sensors ◽  
2020 ◽  
Vol 20 (14) ◽  
pp. 3933
Author(s):  
Mohammed El-Absi ◽  
Feng Zheng ◽  
Ashraf Abuelhaija ◽  
Ali Al-haj Abbas ◽  
Klaus Solbach ◽  
...  

Indoor localization based on unsynchronized, low-complexity, passive radio frequency identification (RFID) using the received signal strength indicator (RSSI) has a wide potential for a variety of internet of things (IoTs) applications due to their energy-harvesting capabilities and low complexity. However, conventional RSSI-based algorithms present inaccurate ranging, especially in indoor environments, mainly because of the multipath randomness effect. In this work, we propose RSSI-based localization with low-complexity, passive RFID infrastructure utilizing the potential benefits of large-scale MIMO technology operated in the millimeter-wave band, which offers channel hardening, in order to alleviate the effect of small-scale fading. Particularly, by investigating an indoor environment equipped with extremely simple dielectric resonator (DR) tags, we propose an efficient localization algorithm that enables a smart object equipped with large-scale MIMO exploiting the RSSI measurements obtained from the reference DR tags in order to improve the localization accuracy. In this context, we also derive Cramer–Rao lower bound of the proposed technique. Numerical results evidence the effectiveness of the proposed algorithms considering various arbitrary network topologies, and results are compared with an existing algorithm, where the proposed algorithms not only produce higher localization accuracy but also achieve a greater robustness against inaccuracies in channel modeling.


Sign in / Sign up

Export Citation Format

Share Document