Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On Frame and Orientation Localization for Relative Sensing Networks
UCSB.
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
University of Waterloo.
UCSB.
Show others and affiliations
2013 (English)In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 49, no 1, 206-213 p.Article in journal (Refereed) Published
Abstract [en]

We develop a novel localization theory for networks of nodes that measure each other's bearing, 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 planar 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-squares estimate of the unknown node orientations in a ring network given angle-of-arrival sensing. For arbitrary connected graphs, our second algorithm exploits kinematic relationships among the orientations of nodes 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 mean-square error due to the noisy measurements in a way that is comparable to the amount of noise reduction obtained by the classic least-square estimator. We then consider networks in 3-dimensional space and we explore necessary and sufficient conditions for orientation localizability in the noiseless case.

Place, publisher, year, edition, pages
Elsevier, 2013. Vol. 49, no 1, 206-213 p.
Keyword [en]
Decentralized systems, Distributed control, Sensor networks
National Category
Robotics Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-50604DOI: 10.1016/j.automatica.2012.09.014ISI: 000313772600022Scopus ID: 2-s2.0-84871264399OAI: oai:DiVA.org:kth-50604DiVA: diva2:462279
Funder
Swedish Research CouncilKnut and Alice Wallenberg Foundation
Note

QC 20130205

Available from: 2012-01-18 Created: 2011-12-06 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

fulltext(314 kB)302 downloads
File information
File name FULLTEXT01.pdfFile size 314 kBChecksum SHA-512
694dd25af0d115d622e6b698cb6da6a55bb6024d44da8b6da7ddddafba9f6d7f13de68c6a8f00d3a552bbcd6110936a5a66cf25ee791dfea31dd7efe563dc832
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Shames, Iman
By organisation
Automatic ControlACCESS Linnaeus Centre
In the same journal
Automatica
RoboticsControl Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 302 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 96 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf