Consensus seeking over random weighted directed graphs

IEEE Transactions on Automatic Control

Volumn 52, Issue 9, 2007, Pages 1767-1773

  Porfiri, Maurizio ^a   Stilwell, Daniel L ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b State University   (United States)

Author keywords

Consensus problem; Directed graphs; Fast switching; Random graphs; Weighted graphs

Indexed keywords

ASYMPTOTIC ANALYSIS; DATA PROCESSING; RANDOM PROCESSES; STOCHASTIC CONTROL SYSTEMS;

RANDOM GRAPH; STOCHASTIC INFORMATION NETWORK; WEIGHTED GRAPH;

GRAPH THEORY;

EID: 34648837204     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2007.904603     Document Type: Article

References (20)

1. W. Ren, R. W. Beard, and E. M. Atkins, "A survey of consensus problems in multi-agent coordination," in Proc. Amer. Contr. Conf., Jun. 2005, vol. 3, pp. 1859-1864.
2. C. Godsil and G. Royle, Algebraic Graph Theory. New York: Springer-Verlag, 2001.
3. Y. Hatano and M. Mesbahi, "Agreement over random networks," IEEE Trans. Autom. Control, vol. 50, no. 11, pp. 1867-1872, 2005.
4. A. Jadbabaie, J. Lin, and A. S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Trans. Autom. Control, vol. 48, no. 6, pp. 988-1001, Jun. 2003.
5. W. Ren and R. W. Beard, "Consensus seeking in multiagent systems under dynamically changing interaction topologies," IEEE Trans. Autom. Control, vol. 50, no. 5, pp. 655-661, 2005.
6. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE Trans. Autom. Control, vol. 49, pp. 1520-1533, Sep. 2004.
7. L. Fang and P. Antsaklis, "On communication requirements for multi-agent consensus seeking," in Proc. 2005 Workshop Networked Embedded Sensing Contr., Oct. 2005, University of Notre Dame.
8. L. Xiao and S. Boyd, "Fast linear iterations for distributed averaging," Syst. Contr. Lett., vol. 53, pp. 65-78, 2004.
9. D. J. Stilwell, E. M. Bollt, and D. G. Roberson, "Sufficient conditions for fast switching synchronization in time varying network topologies," SIAM J. Appl. Dynamical Syst., vol. 6, pp. 140-156, 2006.
10. Y. Su and A. Bhaya, "Convergence of pseudocontractions and applications to two-stage and asynchronous multisplitting for singular m-matrices," SIAM J. Matrix Anal. Applicat., vol. 22, no. 3, pp. 948-964, 2001.
11. P. Erdös and A. Rényi, "On the evolution of random graphs," Pub. Math. Inst. Hungar. Acad. Sci, vol. 5, pp. 17-61, 1960.
12. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
13. C. W. Wu, "Algebraic connectivity of directed graphs," Linear Multilinear Algebra, vol. 53, no. 3, pp. 203-223, 2005.
14. V. D. Blondel, J. M. Hendrickx, A. Olshevsky, and J. N. Tsitsiklis, "Convergence in multiagent coordination, consensus, and flocking," in Proc. IEEE Conf. Decision Contr. Eur. Contr. Conf., Sevilla, Spain, 2005, pp. 2996-3000.
15. A. Gut, Probability: A Graduate Course. New York: Springer, 2005.
16. J. Tsitsiklis, D. Bertsekas, and M. Athans, "Distributed asynchronous deterministic and stochastic gradient optimization algorithms," IEEE Trans. Autom. Control, vol. AC-31, no. 9, pp. 803-812, 1986.
17. H. Kushner, Introduction to Stochastic Control. New York: Holt, Rinehart and Winston, 1971.
18. J. L. Hibey, "Stochastic stability theory for systems containing interval matrices," IEEE Trans. Aerosp. Electron. Syst., vol. 32, no. 4, pp. 1385-1391, 1996.
19. M. Porfiri, D. G. Roberson, and D. J. Stilwell, "Application of exponential splitting methods to fast switching theory," in Proc. Amer. Contr. Conf., Minneapolis, MN, 2006, pp. 5935-5940.
20. J. Tokarzewski, "Stability of periodically switched linear systems and the switching frequency," Int. J. Syst. Sci., vol. 18, no. 4, pp. 697-726, 1987.