Adaptive Weighted K-Nearest Neighbor Trilateration Algorithm for Visible Light Positioning

10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

Abstract

An adaptive weighted K-nearest neighbor (AWKNN) trilateration positioning algorithm fused with the channel state information (CSI) is proposed to optimize the accuracy of the visible light positioning. The core concept behind this algorithm is to combine the WKNN algorithm with ranging based on the CSI. The direct path distance estimated by the CSI is utilized to construct a position set consisting of multiple positions and a corresponding distance database containing multiple distance vectors. The error parameters of the weighted combinations of different distance vectors are calculated iteratively to evaluate the impact of different K-values and weights on the positioning accuracy. The proposed algorithm can achieve high-precision trilateration positioning by adaptively selecting the K-value and weight. A typical 4 m × 4 m × 3 m indoor multipath scene with four LEDs is established to simulate the positioning performance. The simulation results reveal that the mean error of the CSI-based AWKNN algorithm achieves 1.84 cm, with a root mean square error (RMSE) of 2.13 cm. Compared with the CSI-based least squares (LS) method, the CSI-based nonlinear LS method, and the CSI-based WKNN method, the average error of this method is decreased by 29%, 16%, and 17%, whereas the RMSE is reduced by 35%, 14%, and 19%.

Cite

CITATION STYLE

APA

Wang, K., He, Y., Huang, X., & Hong, Z. (2023). Adaptive Weighted K-Nearest Neighbor Trilateration Algorithm for Visible Light Positioning. Photonics, 10(3). https://doi.org/10.3390/photonics10030319

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free