The provision of advanced location-based services in indoor environments is based on the possibility of estimating the positions of mobile devices with sufficient accuracy and robustness. An algorithm to allow a software agent hosted on a mobile device to estimate the position of its device in a known indoor environment is proposed under the ordinary assumption that fixed beacons are installed in the environment at known locations. Rather than making use of geometric considerations to estimate the position of the device, the proposed algorithm first transforms the localization problem into a related optimization problem, which is then solved by means of interval arithmetic to provide the agent with accurate and robust position estimates. The adopted approach solves a major problem that severely limits the accuracy of the position estimates that ordinary geometric algorithms provide when the beacons are positioned to maximize line-of-sight coverage. Experimental results confirm that the proposed algorithm provides position estimates that are independent of the positions of the beacons, and they show that the algorithm outperforms a well-known geometric algorithm.

Interval arithmetic to support effective indoor positioning of software agents / Monica, S.; Bergenti, F.. - In: INTELLIGENZA ARTIFICIALE. - ISSN 1724-8035. - 14:1(2020), pp. 59-73. [10.3233/IA-190042]

Interval arithmetic to support effective indoor positioning of software agents

Monica S.;Bergenti F.
2020

Abstract

The provision of advanced location-based services in indoor environments is based on the possibility of estimating the positions of mobile devices with sufficient accuracy and robustness. An algorithm to allow a software agent hosted on a mobile device to estimate the position of its device in a known indoor environment is proposed under the ordinary assumption that fixed beacons are installed in the environment at known locations. Rather than making use of geometric considerations to estimate the position of the device, the proposed algorithm first transforms the localization problem into a related optimization problem, which is then solved by means of interval arithmetic to provide the agent with accurate and robust position estimates. The adopted approach solves a major problem that severely limits the accuracy of the position estimates that ordinary geometric algorithms provide when the beacons are positioned to maximize line-of-sight coverage. Experimental results confirm that the proposed algorithm provides position estimates that are independent of the positions of the beacons, and they show that the algorithm outperforms a well-known geometric algorithm.
2020
14
1
59
73
Interval arithmetic to support effective indoor positioning of software agents / Monica, S.; Bergenti, F.. - In: INTELLIGENZA ARTIFICIALE. - ISSN 1724-8035. - 14:1(2020), pp. 59-73. [10.3233/IA-190042]
Monica, S.; Bergenti, F.
File in questo prodotto:
File Dimensione Formato  
IA_2020.pdf

Accesso riservato

Tipologia: Versione pubblicata dall'editore
Dimensione 374.47 kB
Formato Adobe PDF
374.47 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1253546
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact