Positioning Error vs. Signal Distribution: An Analysis Towards Lower Error Bound in WLAN Fingerprint Based Indoor Localization

Author(s):  
Mu Zhou ◽  
Feng Qiu ◽  
Zengshan Tian ◽  
Kunjie Xu ◽  
Qing Jiang
Automatica ◽  
2014 ◽  
Vol 50 (8) ◽  
pp. 2196-2198 ◽  
Author(s):  
Ha Binh Minh ◽  
Carles Batlle ◽  
Enric Fossas

1998 ◽  
Vol 34 (16) ◽  
pp. 1555 ◽  
Author(s):  
S. Weiß ◽  
A. Stenger ◽  
R. Rabenstein ◽  
R.W. Stewart

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
He Huang ◽  
Wei Li ◽  
De An Luo ◽  
Dong Wei Qiu ◽  
Yang Gao

Geomagnetic indoor positioning is an attractive indoor positioning technology due to its infrastructure-free feature. In the matching algorithm for geomagnetic indoor localization, the particle filter has been the most widely used. The algorithm however often suffers filtering divergence when there is continuous variation of the indoor magnetic distribution. The resampling step in the process of implementation would make the situation even worse, which directly lead to the loss of indoor positioning solution. Aiming at this problem, we have proposed an improved particle filter algorithm based on initial positioning error constraint, inspired by the Hausdorff distance measurement point set matching theory. Since the operating range of the particle filter cannot exceed the magnitude of the initial positioning error, it avoids the adverse effect of sampling particles with the same magnetic intensity but away from the target during the iteration process on the positioning system. The effectiveness and reliability of the improved algorithm are verified by experiments.


Author(s):  
F. Gu ◽  
A. Kealy ◽  
K. Khoshelham ◽  
J. Shang

Indoor localization is important for a variety of applications such as location-based services, mobile social networks, and emergency response. Fusing spatial information is an effective way to achieve accurate indoor localization with little or with no need for extra hardware. However, existing indoor localization methods that make use of spatial information are either too computationally expensive or too sensitive to the completeness of landmark detection. In this paper, we solve this problem by using the proposed landmark graph. The landmark graph is a directed graph where nodes are landmarks (e.g., doors, staircases, and turns) and edges are accessible paths with heading information. We compared the proposed method with two common Dead Reckoning (DR)-based methods (namely, Compass + Accelerometer + Landmarks and Gyroscope + Accelerometer + Landmarks) by a series of experiments. Experimental results show that the proposed method can achieve 73% accuracy with a positioning error less than 2.5 meters, which outperforms the other two DR-based methods.


Sign in / Sign up

Export Citation Format

Share Document