A platform for research: civil engineering, architecture and urbanism
Generalized inner constraints for geodetic network densification problems
Abstract The estimated coordinates from a minimum-constrained (MC) network adjustment are generally influenced by two different error sources, that is the data noise from the available measurements and the so-called datum noise due to random errors in the fiducial coordinates that are used for the datum definition with regard to an external reference frame. Although the latter source does not affect the estimable characteristics of a MC solution, it still contributes a datum-related noise to the estimated positions which reflects the uncertainty of the coordinate system itself for the adjusted network. The aim of this paper is to develop a new type of MCs which minimizes both of the aforementioned effects in the final coordinates of an adjusted network. This particular problem has not been treated in the geodetic literature and the solution which is presented herein offers an elegant unification of the classic inner constraints into a more general framework for the datum choice problem of network optimization theory. Furthermore, the findings of our study provide a useful and rigorous tool for frame densification problems by means of an optimal MC adjustment in geodetic networks.
Generalized inner constraints for geodetic network densification problems
Abstract The estimated coordinates from a minimum-constrained (MC) network adjustment are generally influenced by two different error sources, that is the data noise from the available measurements and the so-called datum noise due to random errors in the fiducial coordinates that are used for the datum definition with regard to an external reference frame. Although the latter source does not affect the estimable characteristics of a MC solution, it still contributes a datum-related noise to the estimated positions which reflects the uncertainty of the coordinate system itself for the adjusted network. The aim of this paper is to develop a new type of MCs which minimizes both of the aforementioned effects in the final coordinates of an adjusted network. This particular problem has not been treated in the geodetic literature and the solution which is presented herein offers an elegant unification of the classic inner constraints into a more general framework for the datum choice problem of network optimization theory. Furthermore, the findings of our study provide a useful and rigorous tool for frame densification problems by means of an optimal MC adjustment in geodetic networks.
Generalized inner constraints for geodetic network densification problems
Kotsakis, C. (author)
Journal of Geodesy ; 87
2013
Article (Journal)
English
BKL:
38.73
Geodäsie
Generalized inner constraints for geodetic network densification problems
Online Contents | 2013
|Comparison of Four Geodetic Network Densification Solutions
Online Contents | 2009
|Rigorous mathematical models for the densification and integration of geodetic networks
Online Contents | 1990
|