APOTSA: Anchor Placement Optimisation Using Discrete Tabu Search Algorithm for Area‐Based Localisation

Author:

Nabavi Sayyidshahab12ORCID,Schauer Joachim3,Boano Carlo Alberto2,Römer Kay2

Affiliation:

1. Institute of Electronic Engineering FH JOANNEUM Graz Austria

2. Institute of Technical Informatics Graz University of Technology Graz Austria

3. Institute of Software Design and Security FH JOANNEUM Graz Austria

Abstract

AbstractRecently, there has been an increasing interest in indoor localisation due to the demand for location‐based services. Diverse techniques have been described in the literature to improve indoor localisation services, but their accuracy is significantly affected by the number and location of the anchors, which act as a reference point for localising tags in a given space. The authors focus on indoor area‐based localisation. A set of anchors defines certain geographical areas, called residence areas, and the location of a tag is approximated by the residence area in which the tag is placed. Hence the position is not given by exact coordinates. In this approach, placing the anchors such that the resulting residence areas are small on average yields a high‐quality localisation accuracy. The authors’ main contribution is the introduction of a discretisation method to calculate the residence areas for a given anchor placement more efficiently. This method reduces the runtime compared to the algorithms from the literature dramatically and hence allows us to search the solution space more efficiently. The authors propose APOTSA, a novel approach for discovering a high‐quality placement of anchors to improve the accuracy of area‐based indoor localisation systems while requiring a shorter execution time than existing approaches. The proposed algorithm is based on Tabu search and optimises the localisation accuracy by minimising the expected residence area. APOTSA's localisation accuracy and time of execution are evaluated by different indoor‐localisation scenarios involving up to five anchors. The results indicate that the expected residence area and the time of execution can be reduced by up to 9.5% and 99% compared to the state‐of‐the‐art local search anchors placement (LSAP) algorithm, respectively.

Publisher

Institution of Engineering and Technology (IET)

Reference26 articles.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3