Bound analysis for anchor selection in cooperative localization

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Anchor selection refers to choosing a small portion of the nodes with known locations to ensure the unique localizability and/or improve the accuracy of cooperative localization. Focusing on the localization accuracy, conventional practice suggests that the anchors should be deployed on the perimeter of the network. This paper derives the perimeter anchor deployment strategy by performing a bound analysis for the Cramér-Rao lower bound (CRLB) which quantifies the localization accuracy. It is proved that the uniform perimeter anchor deployment strategy is the optimal to fix an isotropically discriminable relative configuration whose nodes are randomly deployed onto a two-dimensional plane. For the relative configuration specified by the internode distance measurements, we introduce an error metric to evaluate the anchor selection performance, together with an upper bound that is independent of anchor selection.

Cite

CITATION STYLE

APA

Zhang, P., Cao, A., & Liu, T. (2017). Bound analysis for anchor selection in cooperative localization. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 202, pp. 1–10). Springer Verlag. https://doi.org/10.1007/978-3-319-60753-5_1

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