TY - GEN
T1 - Noisy localization on the sphere
T2 - 2008 International Conference on Intelligent Sensors, Sensor Networks and Information Processing, ISSNIP 2008
AU - Huang, Baoqi
AU - Yu, Changbin
AU - Anderson, Brian D.O.
PY - 2008
Y1 - 2008
N2 - In real localization systems, noise from hardware and the environment makes it impossible for any algorithms to precisely localize objects, e.g. sensors and targets. Besides that, planar approximation is another source of error when dealing with localization over spherical surfaces, e.g. the surface of the earth, though it is neglected in many algorithms. This work deals with evaluating the error arising from planar approximation in localization problems over spherical surfaces. We characterize the error as arising for two different though related causes, and accordingly introduce concepts of radial error and angular error to account for these. A localization algorithm, based upon a Cayley-Menger Determinantal condition introduced recently for localization problems, is utilized for the analysis, and analytical results are confirmed through a number of simulations. As an end result of the study, we characterize the regions over which a planar approximation will be satisfactory, given an upper bound on the acceptable error it introduces in comparison with treating localization as a task in three-dimensional space.
AB - In real localization systems, noise from hardware and the environment makes it impossible for any algorithms to precisely localize objects, e.g. sensors and targets. Besides that, planar approximation is another source of error when dealing with localization over spherical surfaces, e.g. the surface of the earth, though it is neglected in many algorithms. This work deals with evaluating the error arising from planar approximation in localization problems over spherical surfaces. We characterize the error as arising for two different though related causes, and accordingly introduce concepts of radial error and angular error to account for these. A localization algorithm, based upon a Cayley-Menger Determinantal condition introduced recently for localization problems, is utilized for the analysis, and analytical results are confirmed through a number of simulations. As an end result of the study, we characterize the regions over which a planar approximation will be satisfactory, given an upper bound on the acceptable error it introduces in comparison with treating localization as a task in three-dimensional space.
UR - http://www.scopus.com/inward/record.url?scp=63149187381&partnerID=8YFLogxK
U2 - 10.1109/ISSNIP.2008.4761961
DO - 10.1109/ISSNIP.2008.4761961
M3 - Conference contribution
SN - 9781424429578
T3 - ISSNIP 2008 - Proceedings of the 2008 International Conference on Intelligent Sensors, Sensor Networks and Information Processing
SP - 49
EP - 54
BT - ISSNIP 2008 - Proceedings of the 2008 International Conference on Intelligent Sensors, Sensor Networks and Information Processing
Y2 - 15 December 2008 through 18 December 2008
ER -