基于LANDMARC定位算法复杂度的分区算法改进  

Improvement of Partition Algorithm Based on Complexity of LANDMARC Location Algorithm

作　　者：杨辉[1] 蔡坚勇[1] 高杰星[1] 陈由甲[1] 郑华[1] 

机构地区：[1]福建师范大学光电与信息工程学院,福建福州350007

出　　处：《计算机系统应用》2013年第5期103-106,121,共5页Computer Systems & Applications

摘　　要：本文重点讨论研究了基于RFID的LANDMARC室内定位系统,然后在此基础上总结了原LANDMARC系统的不足,并针对LANDMARC系统中的算法复杂度进行分析,提出了一种分区算法来减小系统算法的复杂度.实验结果表明,相比原系统算法,改进后的算法在提高系统定位精度和定位性能的前提下,减小了算法总体的复杂度.Based on the analysis of the basic principle and characteristics of RFID, the existing RFID indoor location system LANDMARC was discussed in detail. Then, the inadequate of LANDMARC system was proposed and summarized. In order to reduce the complexity of the algorithm, the partition algorithm was proposed. Simulation results show that the enhanced partition algorithm can achieve better location accuracy and higher location performance than the original LANDMARC algorithm. At the same time, the partition algorithm reduced the complexity of algorithm markedly.

关 键 词：室内定位 射频识别 LANDMARC系统 分区算法 算法复杂度 

分 类 号：TP391.44[自动化与计算机技术—计算机应用技术]