Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ICC.2013.6655520 | 2013 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) |
Keywords | Field | DocType |
A Priori Information, Map, Localization, Cramer-Rao bound, Computational Complexity | Asymptotic computational complexity,Mathematical optimization,Computer science,A priori and a posteriori,Tracking system,Algorithm,Real-time computing,Computational complexity theory | Conference |
ISSN | Citations | PageRank |
1550-3607 | 1 | 0.36 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francesco Montorsi | 1 | 12 | 3.51 |
| Santiago Mazuelas | 2 | 227 | 15.73 |
| Giorgio Matteo Vitetta | 3 | 130 | 13.97 |
| Moe Z. Win | 4 | 2225 | 196.12 |