Performance relationship between distributed and centralised cooperative localisations. Issue 2 (1st January 2014)

• Record Type: Journal Article
• Authors: Shi, Yulong; Cui, Qimei; Cao, Siqi; Zhang, Xuefei; Tao, Xiaofeng
• Is Part Of: Electronics letters. Volume 50:Issue 2(2014)
• Page Start: 127
• Page End: 128
• Publication Date: 2014-01-01
• Subjects: distributed algorithms -- estimation theory -- iterative methods -- mobile computing -- cooperative communication; performance relationship -- distributed cooperative localisation algorithm -- centralised cooperative localisation algorithm -- CrameÌrâ€"Rao lower bounds -- infinite iterations; Electronics -- Periodicals; 621.381
• DOI: 10.1049/el.2013.3452
• Languages: English
• ISSNs: 0013-5194

Abstract

Abstract : Cooperative localisation can be classified into distributed and centralised algorithms. However, thorough theoretical analysis on the discrepancy and correlation of their performances has not yet been given by existing researches. Presented are different Cramér‐Rao lower bounds for these two kinds of algorithms and the performance relationship is investigated through their own lower bounds. Furthermore, it is theoretically proved that after infinite iterations, distributed and centralised algorithms have the identical lower bound.