IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v13y2017i10p1550147717733424.html
   My bibliography  Save this article

Nonlinear programming-based ranging optimization for three-dimensional indoor time of arrival localization

Author

Listed:
  • Jian Sun
  • Yongling Fu
  • Jie He
  • Shengguang Li
  • Jian Fu

Abstract

The distribution of ranging errors of time of arrival techniques fails to satisfy zero means and equal variances. It is one of the major causations of position error of least square–based localization algorithm. The optimization of time of arrival ranging is defined as a nonlinear programming problem. Then, time of arrival ranging error model and geometric constraints are used to define the initial values, objective functions, and constraints of nonlinear programming, as well as to detect line of sight and nonline of sight. A three-dimensional localization algorithm of an indoor time of arrival–based positioning is proposed based on least square and the optimization algorithm. The performance of the ranging and localization accuracies is evaluated by simulation and field testing. Results show that the optimized ranging error successfully satisfies zero mean value and equal variances. Furthermore, the ranging and localization accuracies are significantly improved.

Suggested Citation

  • Jian Sun & Yongling Fu & Jie He & Shengguang Li & Jian Fu, 2017. "Nonlinear programming-based ranging optimization for three-dimensional indoor time of arrival localization," International Journal of Distributed Sensor Networks, , vol. 13(10), pages 15501477177, October.
    • Handle: RePEc:sae:intdis:v:13:y:2017:i:10:p:1550147717733424
    DOI: 10.1177/1550147717733424
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717733424
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147717733424?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
    ---><---

    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:sae:intdis:v:13:y:2017:i:10:p:1550147717733424. 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: SAGE Publications (email available below). General contact details of provider: .

    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.