Skip to main content
Log in

Coordination in multiagent systems and Laplacian spectra of digraphs

  • Control in Social Economic Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Constructing and studying distributed control systems requires the analysis of the Laplacian spectra and the forest structure of directed graphs. In this paper, we present some basic results of this analysis. We also discuss the application of these results published earlier to decentralized control and touch upon some problems of spectral graph theory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Varshavskii, V. and Pospelov, D., Orkestr igraet bez dirizhera: razmyshleniya ob evolyutsii nekotorykh tekhnichiskikh system i upravlenii imi, Moscow: Nauka, 1984. Translated under the title Puppets without Strings, Moscow: Mir, 1988.

    Google Scholar 

  2. DeGroot, M.H., Reaching a Consensus, J. Am. Statist. Associat., 1974, vol. 69, no. 345, pp. 118–121.

    Article  MATH  Google Scholar 

  3. Dalkey, N.C. and Helmer, O., An Experimental Application of the Delphi Method to the Use of Experts, Manag. Sci., 1963, vol. 9, pp. 458–467.

    Article  Google Scholar 

  4. Borkar, V. and Varaiya, P., Asymptotic Agreement in Distributed Estimation, IEEE Trans. Automat. Control., 1982, vol. 27, pp. 650–655.

    Article  MATH  MathSciNet  Google Scholar 

  5. Tsitsiklis, J.N. and Athens, M., Convergence and Asymptotic Agreement in Distributed Decision Problems, IEEE Trans. Automat. Control., 1984, vol. 29, pp. 690–696.

    Article  MATH  MathSciNet  Google Scholar 

  6. Reynolds, C.W., Flocks, Herds, and Schools: A Distributed Behavioral Model, Comput. Graphics, 1987, vol. 21, no. 4, pp. 25–34.

    Article  MathSciNet  Google Scholar 

  7. Merris, R., Laplacian Matrices of Graphs: A Survey, Linear Algebra Appl., 1994, vol. 197–198, pp. 143–176.

    Article  MathSciNet  Google Scholar 

  8. Chung, F.R.K., Spectral Graph Theory, Providence: Am. Math. Soc., 1997.

    MATH  Google Scholar 

  9. Godsil, C. and Royle, G., Algebraic Graph Theory, New York: Springer-Verlag, 2001.

    MATH  Google Scholar 

  10. Agaev, R. and Chebotarev, P., On the Spectra of Nonsymmetric Laplacian Matrices, Linear Algebra Appl., 2005, vol. 399, pp. 157–168.

    Article  MATH  MathSciNet  Google Scholar 

  11. Agaev, R.P. and Chebotarev, P.Yu. The Matrix of Maximum Out Forests of a Digraph and Its Applications, Automat. Remote Control, 2000, vol. 61, no. 9, part 1, pp. 1424–1450.

    MATH  MathSciNet  Google Scholar 

  12. Jadbabaie, A., Lin, J., and Morse, A.S., Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules, IEEE Trans. Automat. Control, 2003, vol. 48, no. 6, pp. 988–1001.

    Article  MathSciNet  Google Scholar 

  13. Ren, W., Beard, R.W., and McLain, T.W., Coordination Variables and Consensus Building in Multiple Vehicle Systems, in Cooperative Control: A Post-Workshop Volume 2003, Block Island Workshop on Cooperative Control, Kumar, V., Leonard, N.E., and Morse, A.S., Eds., New York: Springer-Verlag, 2005, pp. 171–188.

    Google Scholar 

  14. Caughman, J.S., Lafferriere, G., Veerman, J.J.P, and Williams, A., Decentralized Control of Vehicle Formations, Syst. Control Lett., 2005, vol. 54, no. 9, pp. 899–910.

    Article  MATH  MathSciNet  Google Scholar 

  15. Lin, Z., Francis, B., and Maggiore, M., Necessary and Sufficient Graphical Conditions for Formation Control of Unicycles, IEEE Trans. Automat. Control, 2005, vol. 50, no. 1, pp. 121–127.

    Article  MathSciNet  Google Scholar 

  16. Moreau, L., Stability of Multiagent Systems with Time-Dependent Communication Links, IEEE Trans. Automat. Control, 2005, vol. 50, no. 2, pp. 169–182.

    Article  MathSciNet  Google Scholar 

  17. Agaev, R.P. and Chebotarev, P.Yu., On Determining the Eigenprojection and Components of a Matrix, Automat. Remote Control, 2002, vol. 63, no. 10, pp. 1537–1545.

    Article  MATH  MathSciNet  Google Scholar 

  18. Rothblum, U.G., Computation of the Eigenprojection of a Nonnegative Matrix at Its Spectral Radius, Math. Program. Study, 1976, vol. 6, pp. 188–201.

    MathSciNet  Google Scholar 

  19. Agaev, R.P. and Chebotarev, P.Yu., Spanning Forests of a Digraph and Their Applications, Automat. Remote Control, 2001, vol. 62, no. 3, pp. 443–466.

    Article  MATH  MathSciNet  Google Scholar 

  20. Chebotarev, P. and Agaev, R., Forest Matrices Around the Laplacian Matrix, Linear Algebra Appl., 2002, vol. 356, pp. 253–274.

    MATH  MathSciNet  Google Scholar 

  21. Wentzell, A.D. and Freidlin, M.I., On Small Random Perturbations of Dynamical Systems, Russ. Math. Surveys, 1970, vol. 25, no. 1, pp. 1–55.

    Article  Google Scholar 

  22. Leighton, T. and Rivest, R.L., The Markov Chain Tree Theorem, Computer Science Techn. Rep. MIT/LCS/TM-249, Cambridge: Laboratory of Computer Science, MIT, 1983.

    Google Scholar 

  23. Olfati-Saber, R., Fax, J.A., and Murray, R.M., Consensus and Cooperation in Networked Multi-Agent Systems, Proc. IEEE, 2007, vol. 95, no. 1, pp. 215–233.

    Article  Google Scholar 

  24. Caughman, J.S. and Veerman, J.J.P., Kernels of Directed Graph Laplacians, Electron. J. Combinat., 2006, vol. 13, no. 1-R39.

  25. Ren, W., Beard, R.W., and Kingston, D.B., Multi-Agent Kalman Consensus with Relative Uncertainty, Proc. Am. Control Conf., Portland, 2005, pp. 1865–1870.

  26. Moreau, L., Stability of Continuous-Time Distributed Consensus Algorithms, Proc. IEEE Conf. Decision Control, Paradise Island, Bahamas, 2004, pp. 3998–4003.

  27. Fang, L. and Antsaklis, P.J., On Communication Requirements for Multiagent Consensus Seeking, in Networked Embedded Sensing and Control, Lecture Notes in Control Inform. Sci., Antsaklis, P.J. and Tabuada, P., Eds., Berlin: Springer-Verlag, 2006, vol. 331, pp. 53–67.

    Google Scholar 

  28. Xiao, L. and Boyd, S., Fast Linear Iterations for Distributed Averaging, Syst. Control Lett., 2004, vol. 53, pp. 65–78.

    Article  MATH  MathSciNet  Google Scholar 

  29. Kim, Y. and Mesbahi, M., On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian, IEEE Trans. Automat. Control, 2006, vol. 51, pp. 116–120.

    Article  MathSciNet  Google Scholar 

  30. Olfati-Saber, R. and Murray, R.M., Consensus Problems in Networks of Agents with Switching Topology and Time-Delays, IEEE Trans. Automat. Control, 2004, vol. 49, pp. 1520–1533.

    Article  MathSciNet  Google Scholar 

  31. Veerman, J.J.P., Lafferriere, G., Caughman, J.S., and Williams, A., Flocks and Formations, J. Statist. Physics, 2005, vol. 121, no. 5–6, pp. 901–936.

    Article  MATH  MathSciNet  Google Scholar 

  32. Wu, C.W., Synchronization in Complex Networks of Nonlinear Dynamical Systems, Singapore: World Scientific, 2007.

    MATH  Google Scholar 

  33. Preciado, V.M. and Verghese, G.C., Synchronization in Generalized Erdös-R’enyi Networks of Nonlinear Oscillators, Proc. IEEE Conf. Decision Control, Eur. Control Conf., Seville, 2005, pp. 4628–4633.

  34. Ren, W. and Atkins, E., Second-Order Consensus Protocols in Multiple Vehicle Systems with Local Interactions, Proc. AIAA Guidance, Navigation, Control Conf., San Francisco, 2005, paper AIAA-2005-6238.

  35. Lawton, J.R., Beard, R.W., and Young, B., A Decentralized Approach to Formation Maneuvers, IEEE Trans. Robot. Automat., 2003, vol. 19, no. 6, pp. 933–941.

    Article  Google Scholar 

  36. Dmitriev, N. and Dynkin, E., Characteristic Roots of Stochastic Matrices, Izv. Akad. Nauk SSSR (Bull. Acad. Sci. USSR), Mat., 1946, vol. 10, pp. 167–184. Translated in Eleven Papers Translated from the Russian, Bernik, V.I., Ed., Providence: Am. Math. Soc., 1988.

    MATH  MathSciNet  Google Scholar 

  37. Ren, W., Beard, R.W., and Atkins, E.M., Information Consensus in Multivehicle Cooperative Control, IEEE Control Syst. Magazin, 2007, vol. 27, no. 2, pp. 71–82.

    Article  Google Scholar 

  38. Ren, W. and Beard, R.W., Distributed Consensus in Multi-Vehicle Cooperative Control, London: Springer-Verlag, 2008.

    MATH  Google Scholar 

  39. Regmi, A., Sandoval, R., Byrne, R., et al., Experimental Implementation of Flocking Algorithms in Wheeled Mobile Robots, Proc. Am. Control Conf., Portland, 2005, pp. 4917–4922.

  40. Marshall, J.A., Fung, T., Broucke, M.E., et al., Experiments in Multirobot Coordination, Robot. Autonom. Syst., 2006, vol. 54, no. 3, pp. 265–275.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © P.Yu. Chebotarev, R.P. Agaev, 2009, published in Avtomatika i Telemekhanika, 2009, No. 3, pp. 136–151.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chebotarev, P.Y., Agaev, R.P. Coordination in multiagent systems and Laplacian spectra of digraphs. Autom Remote Control 70, 469–483 (2009). https://doi.org/10.1134/S0005117909030126

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117909030126

PACS numbers

Navigation