On the Impact of A Priori Information on Localization Accuracy and Complexity

View Researcher II's Other Codes

Disclaimer: “The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).”

Please contact us in case of a broken link from here

Authors Montorsi, F.; Mazuelas S.; Vitetta, G.; Win M. Z.
Journal/Conference Name IEEE International Conference on Communications (ICC)
Paper Category
Paper Abstract Accuracy and complexity represent fundamental aspects of localization and tracking systems. In this manuscript the impact of a priori knowledge about agent position on the accuracy and the complexity of localization algorithms is investigated. In particular, first Cramer-Rao bounds on localization accuracy are derived under the assumption that a priori information is described by a map restricting the agent position to a specific region. Then, the computational complexity of optimal map-aware and map-unaware localization techniques is assessed. Our results evidence that: a) map-aware localization accuracy can be related to some geometrical features of the map but usually exhibits a complicated dependence on them; b) in some scenarios map-aware localization algorithms provide better accuracy than their map-unaware counterparts at comparable computational complexity.
Date of publication 2013
Code Programming Language MATLAB
Comment

Copyright Researcher II 2021