An RFID Indoor Positioning Algorithm Based on Bayesian Probability and K-Nearest Neighbor

• Published in: Sensors (Basel, Switzerland) Vol. 17; no. 8; p. 1806
• Main Authors: Xu, He, Ding, Ye, Li, Peng, Wang, Ruchuan, Li, Yizhu
• Format: Journal Article
• Language: English
• Published: Switzerland MDPI AG 05.08.2017; MDPI
• Subjects: Algorithms; Bayesian probability; Global positioning systems; GPS; indoor positioning; K-Nearest Neighbor; RFID; K-Nearest Neighbor; RFID; indoor positioning; Bayesian probability
• ISSN: 1424-8220; 1424-8220
• DOI: 10.3390/s17081806

The Global Positioning System (GPS) is widely used in outdoor environmental positioning. However, GPS cannot support indoor positioning because there is no signal for positioning in an indoor environment. Nowadays, there are many situations which require indoor positioning, such as searching for a book in a library, looking for luggage in an airport, emergence navigation for fire alarms, robot location, etc. Many technologies, such as ultrasonic, sensors, Bluetooth, WiFi, magnetic field, Radio Frequency Identification (RFID), etc., are used to perform indoor positioning. Compared with other technologies, RFID used in indoor positioning is more cost and energy efficient. The Traditional RFID indoor positioning algorithm LANDMARC utilizes a Received Signal Strength (RSS) indicator to track objects. However, the RSS value is easily affected by environmental noise and other interference. In this paper, our purpose is to reduce the location fluctuation and error caused by multipath and environmental interference in LANDMARC. We propose a novel indoor positioning algorithm based on Bayesian probability and K-Nearest Neighbor (BKNN). The experimental results show that the Gaussian filter can filter some abnormal RSS values. The proposed BKNN algorithm has the smallest location error compared with the Gaussian-based algorithm, LANDMARC and an improved KNN algorithm. The average error in location estimation is about 15 cm using our method.