The knowledge of environmental maps (i.e., map-awareness) can appreciably improve the accuracy of optimal methods for position estimation in indoor scenarios. This improvement, however, is achieved at the price of a significant complexity increase with respect to the case of map-unawareness, specially for large maps. This is mainly due to the fact that optimal map-aware estimation algorithms require integrating highly nonlinear functions or solving nonlinear and nonconvex constrained optimization problems. In this paper, various techniques for reducing the complexity of such estimators are developed. In particular, two novel strategies for restricting the search domain of map-aware position estimators are developed and the exploitation of state-of-the-art numerical integration and optimization methods is investigated; this leads to the development of a new family of suboptimal map-aware localization algorithms. Our numerical and experimental results evidence that the accuracy of these algorithms is very close to that offered by their optimal counterparts, despite their significantly lower computational complexity.

Reduced-Complexity Algorithms for Indoor Map-Aware Localization Systems / Pancaldi, Fabrizio; Montorsi, Francesco; Vitetta, Giorgio Matteo. - In: INTERNATIONAL JOURNAL OF NAVIGATION AND OBSERVATION. - ISSN 1687-5990. - STAMPA. - 2015:(2015), pp. 1-16. [10.1155/2015/562680]

Reduced-Complexity Algorithms for Indoor Map-Aware Localization Systems

PANCALDI, Fabrizio;MONTORSI, FRANCESCO;VITETTA, Giorgio Matteo
2015

Abstract

The knowledge of environmental maps (i.e., map-awareness) can appreciably improve the accuracy of optimal methods for position estimation in indoor scenarios. This improvement, however, is achieved at the price of a significant complexity increase with respect to the case of map-unawareness, specially for large maps. This is mainly due to the fact that optimal map-aware estimation algorithms require integrating highly nonlinear functions or solving nonlinear and nonconvex constrained optimization problems. In this paper, various techniques for reducing the complexity of such estimators are developed. In particular, two novel strategies for restricting the search domain of map-aware position estimators are developed and the exploitation of state-of-the-art numerical integration and optimization methods is investigated; this leads to the development of a new family of suboptimal map-aware localization algorithms. Our numerical and experimental results evidence that the accuracy of these algorithms is very close to that offered by their optimal counterparts, despite their significantly lower computational complexity.
2015
2015
1
16
Reduced-Complexity Algorithms for Indoor Map-Aware Localization Systems / Pancaldi, Fabrizio; Montorsi, Francesco; Vitetta, Giorgio Matteo. - In: INTERNATIONAL JOURNAL OF NAVIGATION AND OBSERVATION. - ISSN 1687-5990. - STAMPA. - 2015:(2015), pp. 1-16. [10.1155/2015/562680]
Pancaldi, Fabrizio; Montorsi, Francesco; Vitetta, Giorgio Matteo
File in questo prodotto:
File Dimensione Formato  
Articolo_Pubblicato.pdf

Open access

Descrizione: Articolo principale
Tipologia: Versione pubblicata dall'editore
Dimensione 1.96 MB
Formato Adobe PDF
1.96 MB Adobe PDF Visualizza/Apri
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/1074738
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact