Noisy network localization via optimal measurement refinement part 2: Distance-only network localization
2011 (English)In: IFAC Proceedings Volumes: (IFAC-PapersOnline), 2011, no PART 1, 8848-8853 p.Conference paper (Refereed)
In this paper we review some results on the problem of noisy localization and review the characteristics of networks labeled as easily localizable networks. We then present a more general result on such networks before moving to the main problem of interest in this paper. That is, proposing computationally efficient algorithms to refine noisy distance measurements in easily localizable networks.
Place, publisher, year, edition, pages
2011. no PART 1, 8848-8853 p.
, IFAC Proceedings Volumes (IFAC-PapersOnline), ISSN 1474-6670 ; 18
Computationally efficient, Network localization, Optimal measurements, Algorithms
IdentifiersURN: urn:nbn:se:kth:diva-149756DOI: 10.3182/20110828-6-IT-1002.01291ScopusID: 2-s2.0-84866753301ISBN: 9783902661937OAI: oai:DiVA.org:kth-149756DiVA: diva2:749305
18th IFAC World Congress; Milano; Italy; 28 August 2011 through 2 September 2011
QC 201409232014-09-232014-08-272014-10-03Bibliographically approved