On frame and orientation localization for relative sensing networks
Date
2008
Authors
Piovan, Giulia
Shames, Iman
Fidan, Baris
Bullo, Francesco
Anderson, Brian
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers (IEEE Inc)
Abstract
We develop a novel localization theory for planar networks of nodes that measure each other's relative position, i.e., we assume that nodes do not have the ability to perform measurements expressed in a common reference frame. We begin with some basic definitions of frame localizability and orientation localizability. Based on some key kinematic relationships, we characterize orientation localizability for networks with angle-of-arrival sensing. We then address the orientation localization problem in the presence of noisy measurements. Our first algorithm computes a least-square estimate of the unknown node orientations in a ring network given angle-ofarrival sensing. For arbitrary connected graphs, our second algorithm exploits kinematic relationships among the orientation of node in loops in order to reduce the effect of noise. We establish the convergence of the algorithm, and through some simulations we show that the algorithm reduces the meansquare error due to the noisy measurements.
Description
Keywords
Keywords: Angle of arrivals; Connected graphs; Least squares; Localizability; Localization problems; Localization theories; Mean-square errors; Noisy measurements; Planar networks; Reference frames; Relative positions; Ring networks; Sensing networks; Algorithms; K
Citation
Collections
Source
Proceedings of IEEE Conference on Decision and Control 2008
Type
Conference paper
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description