TU Darmstadt / ULB / TUbiblio

Subspace-based algorithm for distance networks

Norrdine, Abdelmoumen (2018):
Subspace-based algorithm for distance networks.
In: Journal of Applied Geodesy, DeGruyter, pp. 259-266, 12, (3), ISSN 1862-9024, DOI: 10.1515/jag-2018-0003, [Online-Edition: https://doi.org/10.1515/jag-2018-0003],
[Article]

Abstract

A three-dimensional distance network is composed of a system of points or nodes located on earth’s surface or in space, in a building or in a construction site. Localization of these nodes is a fundamental operation in geodetic and sensor networks. This paper shows a new method for calculating n-dimensional dynamic distance networks, whereas a spectral decomposition of a symmetric matrix of squared distances is used. Thereby neither approximation, nor iterative solutions are used. By using this method, fixed reference points can be selected as well as noisy distances can be denoised and checked for consistency. Given a realistic scenario, Monte-Carlo simulations show that the proposed method always converge to an optimal solution with less computation time than numerically optimized Levenberg-Marquandt method.

Item Type: Article
Erschienen: 2018
Creators: Norrdine, Abdelmoumen
Title: Subspace-based algorithm for distance networks
Language: English
Abstract:

A three-dimensional distance network is composed of a system of points or nodes located on earth’s surface or in space, in a building or in a construction site. Localization of these nodes is a fundamental operation in geodetic and sensor networks. This paper shows a new method for calculating n-dimensional dynamic distance networks, whereas a spectral decomposition of a symmetric matrix of squared distances is used. Thereby neither approximation, nor iterative solutions are used. By using this method, fixed reference points can be selected as well as noisy distances can be denoised and checked for consistency. Given a realistic scenario, Monte-Carlo simulations show that the proposed method always converge to an optimal solution with less computation time than numerically optimized Levenberg-Marquandt method.

Journal or Publication Title: Journal of Applied Geodesy
Volume: 12
Number: 3
Publisher: DeGruyter
Uncontrolled Keywords: graph algorithms; rigid graphs; EDM; collaborative localization; sensor networks; Indoor positioning; Ultra Wideband localization; SVD
Divisions: 13 Department of Civil and Environmental Engineering Sciences
13 Department of Civil and Environmental Engineering Sciences > Institute of Construction Management
Date Deposited: 08 Jan 2019 10:49
DOI: 10.1515/jag-2018-0003
Official URL: https://doi.org/10.1515/jag-2018-0003
Export:

Optionen (nur für Redakteure)

View Item View Item