Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2017, Vol. 40 ›› Issue (3): 37-42.doi: 10.13190/j.jbupt.2017.03.004

• Papers • Previous Articles     Next Articles

A 3-D Indoor Localization AlgorithmUsing Distance Optimization

HE Jie1, WU De-yang2, LI Xi-fei1, XU Li-yuan1, QI Yue1   

  1. 1. School of Computer and Communication Engineering, University of Science and Technology, Beijing 100083, China;
    2. School of Mathematics and Physics, University of Science and Technology, Beijing 100083, China
  • Received:2016-08-31 Online:2017-06-28 Published:2017-05-25

Abstract: Least Square is a typical three-dimensional location algorithm for time of arrival based indoor positioning system. The precondition of traditional LS algorithm is that the measurement error meets the zero mean and the equal variance. However, the multipath and non-line of sight significant in realistic indoor environment leads TOA ranging error to be non-Gaussian distribution and cannot meet the hypothesis. This conflict leads low localization accuracy. This article presents a distance optimization based least square 3-D indoor localization algorithm. The nonlinear programming method with Cayley-Menger determinant and tetrahedral geometry constraints was adopted by the proposed algorithm to optimize measured distance, which makes the ranging error fit Gaussian distribution and thus improves the localization accuracy of least square. Experiments demonstrate that the proposed distance optimization based least square 3-D localization algorithm achieves better localization accuracy and stability.

Key words: 3-D localization, least square algorithm, distance optimization, geometric constraints

CLC Number: