Distributed randomized algorithms for probabilistic performance analysis

Systems and Control Letters

Volumn 58, Issue 3, 2009, Pages 202-212

  Calafiore, Giuseppe Carlo ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

Consensus and agreement problems; Distributed estimation; Probabilistic robustness; Randomized algorithms

Indexed keywords

PROBABILITY; TELECOMMUNICATION LINKS; TIME VARYING NETWORKS;

COMMUNICATION COMPLEXITIES; COMMUNICATION LINKS; COMPUTATIONAL BURDENS; COMPUTING NODES; COMPUTING UNITS; CONSENSUS AND AGREEMENT PROBLEMS; DISTRIBUTED ESTIMATION; EXPECTED VALUES; PERFORMANCE EVALUATIONS; PRIORI BOUNDS; PROBABILISTIC PERFORMANCES; PROBABILISTIC ROBUSTNESS; RANDOM SAMPLES; RANDOMIZED ALGORITHMS; SYSTEM PERFORMANCES; TIME CONSUMING;

RANDOM NUMBER GENERATION;

EID: 58249132846     PISSN: 01676911     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sysconle.2008.10.010     Document Type: Article

References (21)

1. Bertsekas D., and Tsitsiklis J.N. Parallel and Distributed Computation: Numerical Methods (1989), Prentice Hall
2. Calafiore G., Dabbene F., and Tempo R. A survey of randomized algorithms for control synthesis and performance verification. Journal of Complexity 23 3 (2007) 301-316
3. In: Calafiore G., and Dabbene F. (Eds). Probabilistic and Randomized Methods for Design under Uncertainty (2006), Springer-Verlag, London
4. M.C. Campi, G.C. Calafiore, Notes on the scenario design approach. IEEE Transactions on Automatic Control, (in press) Draft available at: http://staff.polito.it/Documenti/Papers/Campi-Calafiore_TN-TAC-08.pdf
5. Cao M., Morse A.S., and Anderson B.D.O. Reaching a consensus in a dynamically changing environment: A graphical approach. SIAM Journal on Control and Optimization 47 2 (2008) 575-600
6. Carli R., Fagnani F., Speranzon A., and Zampieri S. Communication constraints in the average consensus problem. Automatica 44 (2008) 671-684
7. Davis P.J. Circulant Matrices (1979), Wiley-Interscience, New York
8. Diestel R. Graph Theory (2005), Springer, New York
9. Godsil C., and Royle G. Algebraic Graph Theory (2001), Springer, New York
10. Hartfiel D.J. Nonhomogeneous Matrix Products (2002), World Scientific
11. Hoeffding W. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58 (1963) 13-30
12. Horn R.A., and Johnson C.R. Matrix Analysis (1985), Cambridge University Press, UK
13. Jadbabaie A., Lin J., and Morse A. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control 48 6 (2003) 988-1001
14. P. Khargonekar, A. Tikku, Randomized algorithms for robust control analysis and synthesis have polynomial complexity, in: Proceedings of the IEEE Conference on Decision and Control, 1996
15. Moreau L. Stability of multiagent systems with time-dependent communication links. IEEE Transactions on Automatic Control 50 2 (2005) 169-182
16. Olfati-Saber R., Fax J.A., and Murray R.M. Consensus and cooperation in multi-agent networked systems. Proceedings of the IEEE 95 1 (2007) 215-233
17. Tempo R., Bai E.-W., and Dabbene F. Probabilistic robustness analysis: Explicit bounds for the minimum number of samples. Systems & Control Letters 30 (1997) 237-242
18. Tempo R., Calafiore G., and Dabbene F. Randomized Algorithms for Analysis and Control of Uncertain Systems. Communications and Control Engineering Series. (2004), Springer-Verlag, London
19. Xiao L., and Boyd S. Fast linear iterations for distributed averaging. Systems and Control Letters 53 (2004) 65-78
20. L. Xiao, S. Boyd, S. Lall, Distributed average consensus with time-varying Metropolis weights Automatica, 2006, unpublished manuscript. Available at: http://www.stanford.edu/~boyd/papers/avg_metropolis.html
21. L. Xiao, S. Boyd, S. Lall, A scheme for robust distributed sensor fusion based on average consensus, in: International Conference on Information Processing in Sensor Networks, IPSN 2005, pp. 63-70, April 2005