Robust Estimators in Geodetic Networks Based on a New Metaheuristic: Independent Vortices Search

Geodetic networks provide accurate three-dimensional control points for mapping activities, geoinformation, and infrastructure works. Accurate computation and adjustment are necessary, as all data collection is vulnerable to outliers. Applying a Least Squares (LS) process can lead to inaccuracy over many points in such conditions. Robust Estimator (RE) methods are less sensitive to outliers and provide an alternative to conventional LS. To solve the RE functions, we propose a new metaheuristic (MH), based on the Vortex Search (IVS) algorithm, along with a novel search space definition scheme. Numerous scenarios for a Global Navigation Satellite Systems (GNSS)-based network are generated to compare and analyze the behavior of several known REs. A classic iterative RE and an LS process are also tested for comparison. We analyze the median and trim position of several estimators, in order to verify their impact on the estimates. The tests show that IVS performs better than the original algorithm; therefore, we adopted it in all subsequent RE computations. Regarding network adjustments, outcomes in the parameter estimation show that REs achieve better results in large-scale outliers’ scenarios. For detection, both LS and REs identify most outliers in schemes with large outliers.