Limited benefit of cooperation in distributed relative localization

Important applications in robotic and sensor networks require distributed algorithms to solve the so-called relative localization problem: a node-indexed vector has to be reconstructed from measurements of differences between neighbor nodes. In a recent note, we have studied the estimation error of a popular gradient descent algorithm showing that the mean square error has a minimum at a finite time, after which the performance worsens. This paper proposes a suitable modification of this algorithm incorporating more realistic a priori information on the position. The new algorithm presents a performance monotonically decreasing to the optimal one. Furthermore, we show that the optimal performance is approximated, up to a 1 + ε factor, within a time which is independent of the graph and of the number of nodes. This bounded convergence time is closely related to the minimum exhibited by the previous algorithm and both facts lead to the following conclusion: in the presence of noisy data, cooperation is only useful till a certain limit.

[1]  Ruggero Carli,et al.  Optimal Synchronization for Networks of Noisy Double Integrators , 2011, IEEE Transactions on Automatic Control.

[2]  Nikolaos M. Freris,et al.  Fast distributed smoothing of relative measurements , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[3]  J. Hespanha,et al.  Estimation on graphs from relative measurements , 2007, IEEE Control Systems.

[4]  P.R. Kumar,et al.  Distributed Clock Synchronization over Wireless Networks: Algorithms and Analysis , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[5]  Chiara Ravazzi,et al.  A distributed randomized algorithm for relative localization in sensor networks , 2013, 2013 European Control Conference (ECC).

[6]  Panganamala Ramana Kumar,et al.  Fundamental Limits on Synchronizing Clocks Over Networks , 2011, IEEE Transactions on Automatic Control.

[7]  João Pedro Hespanha,et al.  Estimation From Relative Measurements: Electrical Analogy and Large Graphs , 2008, IEEE Transactions on Signal Processing.

[8]  Sandro Zampieri,et al.  Mean Square Performance of Consensus-Based Distributed Estimation over Regular Geometric Graphs , 2012, SIAM J. Control. Optim..

[9]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[10]  Ruggero Carli,et al.  An exponential-rate consensus-based algorithms for estimation from relative measurements: implementation and performance analysis , 2013 .

[11]  Javier Alonso-Mora,et al.  Limited benefit of joint estimation in multi‐agent iterative learning , 2012 .

[12]  João Pedro Hespanha,et al.  Error Scaling Laws for Linear Optimal Estimation From Relative Measurements , 2009, IEEE Transactions on Information Theory.

[13]  Fabio Fagnani,et al.  Transient and limit performance of distributed relative localization , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[14]  Chiara Ravazzi,et al.  Almost sure convergence of a randomized algorithm for relative localization in sensor networks , 2013, 52nd IEEE Conference on Decision and Control.

[15]  Damiano Varagnolo,et al.  Consensus‐based distributed sensor calibration and least‐square parameter identification in WSNs , 2010 .