Error estimation for the linearized auto-localization algorithm

1Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

The Linearized Auto-Localization (LAL) algorithm estimates the position of beacon nodes in Local Positioning Systems (LPSs), using only the distance measurements to a mobile node whose position is also unknown. The LAL algorithm calculates the inter-beacon distances, used for the estimation of the beacons' positions, from the linearized trilateration equations. In this paper we propose a method to estimate the propagation of the errors of the inter-beacon distances obtained with the LAL algorithm, based on a first order Taylor approximation of the equations. Since the method depends on such approximation, a confidence parameter τ is defined to measure the reliability of the estimated error. Field evaluations showed that by applying this information to an improved weighted-based auto-localization algorithm (WLAL), the standard deviation of the inter-beacon distances can be improved by more than 30% on average with respect to the original LAL method. © 2012 by the authors.

Cite

CITATION STYLE

APA

Guevara, J., Jiménez, A. R., Prieto, J. C., & Seco, F. (2012). Error estimation for the linearized auto-localization algorithm. Sensors, 12(3), 2561–2581. https://doi.org/10.3390/s120302561

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