Reduced-Complexity Algorithms for Indoor Map-Aware Localization Systems. (28th October 2015)

• Record Type: Journal Article
• Authors: Montorsi, Francesco; Pancaldi, Fabrizio; Vitetta, Giorgio M.
• Other Names: Seco-Granados Gonzalo Academic Editor.
• Is Part Of: International journal of navigation and observation. Volume 2015(2015)
• Publication Date: 2015-10-28
• Subjects: Navigation -- Periodicals; Remote sensing -- Periodicals; Geographic information systems -- Periodicals; Global Positioning System -- Periodicals; Earth sciences -- Periodicals; Environmental monitoring -- Periodicals; Navigation; Télédétection; Systèmes d'information géographique; GPS; Sciences de la terre; Environnement -- Surveillance; Earth sciences; Environmental monitoring; Geographic information systems; Global Positioning System; Navigation; Remote sensing; Periodicals; Electronic journals; 629.045
• DOI: 10.1155/2015/562680
• Languages: English
• ISSNs: 1687-5990

Abstract

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.