A semidefinite programming approach for cooperative localization

Ning Wang, Liuqing Yang

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

5 Scopus citations

Abstract

Semidefinite programming (SDP) approach has been widely used to convert nonconvex problems into convex ones in recent years. In this paper, we apply the SDP approach to cooperative localization where the inter-target communication capability is exploited for the purpose of coverage extension and accuracy enhancement. Cooperative Time-of-Arrival (ToA) minimax SDP and Received Signal Strength (RSS) minimax SDP algorithms are proposed. Simulations show that the cooperative localization with SDP can achieve satisfying performance with considerably reduced complexity. In addition, we propose a virtual anchor concept to further improve the localization accuracy, especially in the outside-of-the-convex-hull situations.

Original languageEnglish (US)
Title of host publicationConference Record of the 44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010
Pages487-491
Number of pages5
DOIs
StatePublished - 2010
Externally publishedYes
Event44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010 - Pacific Grove, CA, United States
Duration: Nov 7 2010Nov 10 2010

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Other

Other44th Asilomar Conference on Signals, Systems and Computers, Asilomar 2010
Country/TerritoryUnited States
CityPacific Grove, CA
Period11/7/1011/10/10

Fingerprint

Dive into the research topics of 'A semidefinite programming approach for cooperative localization'. Together they form a unique fingerprint.

Cite this