Noisy network localization via optimal measurement refinement part 2: Distance-only network localization
- Publication Type:
- Conference Proceeding
- Citation:
- IFAC Proceedings Volumes (IFAC-PapersOnline), 2011, 44 (1 PART 1), pp. 8848 - 8853
- Issue Date:
- 2011-01-01
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
1-s2.0-S1474667016450317-main.pdf | Published version | 377.77 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
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. © 2011 IFAC.
Please use this identifier to cite or link to this item: