IDEAS home Printed from https://ideas.repec.org/a/hin/complx/3456923.html
   My bibliography  Save this article

Robust Bearing-Only Localization Using Total Least Absolute Residuals Optimization

Author

Listed:
  • Ji-An Luo
  • Chang-Cheng Xue
  • Dong-Liang Peng

Abstract

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.

Suggested Citation

  • Ji-An Luo & Chang-Cheng Xue & Dong-Liang Peng, 2020. "Robust Bearing-Only Localization Using Total Least Absolute Residuals Optimization," Complexity, Hindawi, vol. 2020, pages 1-13, December.
  • Handle: RePEc:hin:complx:3456923
    DOI: 10.1155/2020/3456923
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/3456923.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2020/3456923.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/3456923?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:3456923. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.