Ajou University repository

Random Forest Based Precise Localization Algorithm for UWB-Embedded Car Keys
Citations

SCOPUS

0

Citation Export

Publication Year
2021-12-01
Publisher
Korean Institute of Communications and Information Sciences
Citation
Journal of Korean Institute of Communications and Information Sciences, Vol.46, pp.2310-2318
Keyword
CarError MitigationNLOS DetectionRandom ForestUWB Localization
All Science Classification Codes (ASJC)
Computer Networks and CommunicationsInformation Systems and ManagementComputer Science (miscellaneous)
Abstract
This paper proposes a novel localization algorithm for a UWB-embedded car key, by which its LOS(Line-of-Sight) or NLOS(Non-Line-of-Sight) condition can be identified based on the Random Forest model and hence its location can be precisely estimated. Most of existing studies utilize the method of analyzing data collected in the LOS environment and predicting the position of objects when they enter the NLOS environment. However, they do not work well in the cases of vehicular environments because it is not easy to collect those data. In this paper, we presented an algorithm to correct errors based on the reliability of measured distance information in each sensor by distinguishing the NLOS environment through the Random Forest model using distance information measured in real-time. According to the experimental results, the proposed algorithm have showed a high accuracy of 94.6% and very good perfomance in terms of localization error, compared to the well-known error correction algorithm, Kalman-Filter.
Language
eng
URI
https://dspace.ajou.ac.kr/dev/handle/2018.oak/34074
DOI
https://doi.org/10.7840/kics.2021.46.12.2310
Fulltext

Type
Article
Show full item record

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Ko, Young-Bae Image
Ko, Young-Bae고영배
Department of Software and Computer Engineering
Read More

Total Views & Downloads

File Download

  • There are no files associated with this item.