Paper Info
Title
Cooperative Network Localizability Via Semidefinite Programming
Abstract
In cooperative localization, the aim is to compute the locations in Euclidean space of a set of nodes performing pair-wise distance measurements. In cases of lack of measurements, several nodes might have multiple feasible solutions meeting the distance constraints. In this paper, we are interested in identifying the nodes that have a unique solution.By employing a semidefinite programming (SDP) formulation of the problem, it is possible to identify only a portion of the uniquely solvable nodes. To improve the identification of these nodes, we develop an iterative algorithm based on SDP. At each iteration, the objective function of the SDP problem is modified in order to identify additional uniquely solvable nodes.We apply this algorithm to study the statistical occurrence of uniquely solvable nodes in uniformly generated networks, and compare the results with the simple SDP. We also investigate the errors in the computed locations for both methods and a variant of the SDP method augmented by bounding constraints on unobserved distances.
Year
DOI
Venue
2011
10.1109/PIMRC.2011.6139714
2011 IEEE 22ND INTERNATIONAL SYMPOSIUM ON PERSONAL INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC)
Keywords
Field
DocType
iterative methods,euclidean space,mathematical programming,statistical analysis
Distance measurement,Pairwise comparison,Mathematical optimization,Computer science,Iterative method,Theoretical computer science,Real-time computing,Euclidean space,Semidefinite programming,Statistical analysis
Conference
Citations 
PageRank 
References 
0
0.34
3
Authors
3
Name
Order
Citations
PageRank
Hadi Noureddine1213.71
Damien Castelain2528.36
Ramesh Pyndiah37917.12