Semidefinite programming for GPS

Ning Wang, Liuqing Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

As a powerful tool to convert non-convex problems into convex ones, semidefinite programming (SDP) has been introduced to both cooperative and non-cooperative positioning systems. In this paper, we propose an SDP approach to solve GPS problems. Compared with conventional algorithms, the SDP approach has an overall improved performance in terms of both accuracy and efficiency. Besides, as a global optimization technique, SDP does not require any smart initial values and can avoid local minima. Simulations will be carried out to corroborate our analyses and comparisons.

Original languageEnglish (US)
Title of host publication24th International Technical Meeting of the Satellite Division of the Institute of Navigation 2011, ION GNSS 2011
Pages2120-2126
Number of pages7
StatePublished - 2011
Externally publishedYes
Event24th International Technical Meeting of the Satellite Division of the Institute of Navigation 2011, ION GNSS 2011 - Portland, OR, United States
Duration: Sep 19 2011Sep 23 2011

Publication series

Name24th International Technical Meeting of the Satellite Division of the Institute of Navigation 2011, ION GNSS 2011
Volume3

Other

Other24th International Technical Meeting of the Satellite Division of the Institute of Navigation 2011, ION GNSS 2011
CountryUnited States
CityPortland, OR
Period9/19/119/23/11

Keywords

  • Global Positioning System (GPS)
  • Semidefinite Programming (SDP)

Fingerprint Dive into the research topics of 'Semidefinite programming for GPS'. Together they form a unique fingerprint.

  • Cite this

    Wang, N., & Yang, L. (2011). Semidefinite programming for GPS. In 24th International Technical Meeting of the Satellite Division of the Institute of Navigation 2011, ION GNSS 2011 (pp. 2120-2126). (24th International Technical Meeting of the Satellite Division of the Institute of Navigation 2011, ION GNSS 2011; Vol. 3).