Reduced-Complexity Algorithms for Indoor Map-Aware Localization Systems

  • Montorsi F
  • Pancaldi F
  • Vitetta G
Citations of this article
Mendeley users who have this article in their library.


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.




Montorsi, F., Pancaldi, F., & Vitetta, G. M. (2015). Reduced-Complexity Algorithms for Indoor Map-Aware Localization Systems. International Journal of Navigation and Observation, 2015, 1–16.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free