Abstract

The Pareto optimality method is applied to the parameter estimation of the Gauss-Helmert weighted 2D similarity transformation assuming that there are measurement errors and/or modeling inconsistencies. In some cases of parametric modeling, the residuals to be minimized can be expressed in different forms resulting in different values for the estimated parameters. Sometimes these objectives may compete in the Pareto sense, namely a small change in the parameters can result in an increase in one of the objectives on the one hand, and a decrease of the other objective on the other hand. In this study, the Pareto optimality approach was employed to find the optimal trade-off solution between the conflicting objectives and the results compared to those from ordinary least squares (OLS), total least squares (TLS) techniques and the least geometric mean deviation (LGMD) approach. The results indicate that the Pareto optimality can be considered as their generalization since the Pareto optimal solution produces a set of optimal parameters represented by the Pareto-set containing the solutions of these techniques (error models). From the Pareto-set, a single optimal solution can be selected on the basis of the decision maker’s criteria. The application of Pareto optimality needs nonlinear multi-objective optimization, which can be easily achieved in parallel via hybrid genetic algorithms built-in engineering software systems such as Matlab. A real-word problem is investigated to illustrate the effectiveness of this approach.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.