Robust Bearing-Only Localization Using Total Least Absolute Residuals Optimization
Robust techniques critically improve bearing-only target localization when the relevant measurements are being corrupted by impulsive noise. Resistance to isolated gross errors refers to the conventional least absolute residual (LAR) method, and its estimate can be determined by linear programming w...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2020-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2020/3456923 |
id |
doaj-2219698aa92448aabc4ef7188fc93013 |
---|---|
record_format |
Article |
spelling |
doaj-2219698aa92448aabc4ef7188fc930132021-01-04T00:01:08ZengHindawi-WileyComplexity1099-05262020-01-01202010.1155/2020/3456923Robust Bearing-Only Localization Using Total Least Absolute Residuals OptimizationJi-An Luo0Chang-Cheng Xue1Dong-Liang Peng2Key Lab for IOT and Information Fusion Technology of ZhejiangInstitute of Information and ControlInstitute of Information and ControlRobust techniques critically improve bearing-only target localization when the relevant measurements are being corrupted by impulsive noise. Resistance to isolated gross errors refers to the conventional least absolute residual (LAR) method, and its estimate can be determined by linear programming when pseudolinear equations are set. The LAR approach, however, cannot reduce the bias attributed to the correlation between system matrices and noise vectors. In the present study, perturbations are introduced into the elements of the system matrix and the data vector simultaneously, and the total optimization problem is formulated based on least absolute deviations. Subsequently, an equivalent form of total least absolute residuals (TLAR) is obtained, and an algorithm is developed to calculate the robust estimate by dual ascent algorithms. Moreover, the performance of the proposed method is verified through the numerical simulations by using two types of localization geometries, i.e., random and linear. As revealed from the results, the TLAR algorithm is capable of exhibiting significantly higher localization accuracy as compared with the LAR method.http://dx.doi.org/10.1155/2020/3456923 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Ji-An Luo Chang-Cheng Xue Dong-Liang Peng |
spellingShingle |
Ji-An Luo Chang-Cheng Xue Dong-Liang Peng Robust Bearing-Only Localization Using Total Least Absolute Residuals Optimization Complexity |
author_facet |
Ji-An Luo Chang-Cheng Xue Dong-Liang Peng |
author_sort |
Ji-An Luo |
title |
Robust Bearing-Only Localization Using Total Least Absolute Residuals Optimization |
title_short |
Robust Bearing-Only Localization Using Total Least Absolute Residuals Optimization |
title_full |
Robust Bearing-Only Localization Using Total Least Absolute Residuals Optimization |
title_fullStr |
Robust Bearing-Only Localization Using Total Least Absolute Residuals Optimization |
title_full_unstemmed |
Robust Bearing-Only Localization Using Total Least Absolute Residuals Optimization |
title_sort |
robust bearing-only localization using total least absolute residuals optimization |
publisher |
Hindawi-Wiley |
series |
Complexity |
issn |
1099-0526 |
publishDate |
2020-01-01 |
description |
Robust techniques critically improve bearing-only target localization when the relevant measurements are being corrupted by impulsive noise. Resistance to isolated gross errors refers to the conventional least absolute residual (LAR) method, and its estimate can be determined by linear programming when pseudolinear equations are set. The LAR approach, however, cannot reduce the bias attributed to the correlation between system matrices and noise vectors. In the present study, perturbations are introduced into the elements of the system matrix and the data vector simultaneously, and the total optimization problem is formulated based on least absolute deviations. Subsequently, an equivalent form of total least absolute residuals (TLAR) is obtained, and an algorithm is developed to calculate the robust estimate by dual ascent algorithms. Moreover, the performance of the proposed method is verified through the numerical simulations by using two types of localization geometries, i.e., random and linear. As revealed from the results, the TLAR algorithm is capable of exhibiting significantly higher localization accuracy as compared with the LAR method. |
url |
http://dx.doi.org/10.1155/2020/3456923 |
work_keys_str_mv |
AT jianluo robustbearingonlylocalizationusingtotalleastabsoluteresidualsoptimization AT changchengxue robustbearingonlylocalizationusingtotalleastabsoluteresidualsoptimization AT dongliangpeng robustbearingonlylocalizationusingtotalleastabsoluteresidualsoptimization |
_version_ |
1714959658198761472 |