Skip to main content

Distributed Laplacian Eigenvalue and Eigenvector Estimation in Multi-robot Systems

  • Chapter
  • First Online:
Distributed Autonomous Robotic Systems

Part of the book series: Springer Proceedings in Advanced Robotics ((SPAR,volume 6))

Abstract

In many multi-robot systems applications, obtaining the spectrum and the eigenvectors of the Laplacian matrix provides very useful information. For example, the second smallest eigenvalue, and the corresponding eigenvector, can be used for connectivity maintenance (see for example Freeman et al., Stability and convergence properties of dynamic average consensus estimators, 2006, [5]). Moreover, as shown in Zareh et al. (Decentralized biconnectivity conditions in multi-robot systems, 2016, [22], Enforcing biconnectivity in multi-robot systems, 2016, [23]), the third smallest eigenvalue provides a metric for ensuring robust connectivity in the presence of single robot failures. In this paper, we introduce a novel decentralized gradient based protocol to estimate the eigenvalues and the corresponding eigenvectors of the Laplacian matrix. The most significant advantage of this method is that there is no limit on the multiplicity of the eigenvalues. Simulations show the effectiveness of the theoretical findings.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bapat, R.B., Pati, S.: Algebraic connectivity and the characteristic set of a graph. Linear Multilinear Algebra 45(2–3), 247–273 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bapat, R.B., Lal, A.K., Pati, S.: On algebraic connectivity of graphs with at most two points of articulation in each block. Linear Multilinear Algebra 60(4), 415–432 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fiedler, M.: Algebraic connectivity of graphs. Czechoslov. Math. J. 23(2), 298–305 (1973)

    MathSciNet  MATH  Google Scholar 

  4. Franceschelli, M., Gasparri, A., Giua, A., Seatzu, C.: Decentralized estimation of Laplacian eigenvalues in multi-agent systems. Automatica 49(4), 1031–1036 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  5. Freeman, R., Yang, P., Lynch, K.: Stability and convergence properties of dynamic average consensus estimators. In: 2006 45th IEEE Conference on Decision and Control, pp. 338–343 (2006). https://doi.org/10.1109/CDC.2006.377078

  6. Guo, J.M.: The Laplacian spectral radius of a graph under perturbation. Comput. Math. Appl. 54(5), 709–720 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)

    Google Scholar 

  8. Kibangou, A.Y., et al.: Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems. Syst. Control Lett. 80, 56–62 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kirkland, S., Fallat, S.: Perron components and algebraic connectivity for weighted graphs. Linear Multilinear Algebra 44(2), 131–148 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kirkland, S., Rocha, I., Trevisan, V.: Algebraic connectivity of k-connected graphs. Czechoslov. Math. J. 65(1), 219–236 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  11. Olfati-Saber, R.: Flocking for multi-agent dynamic systems: algorithms and theory. IEEE Trans. Autom. Control 51(3), 401–420 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Olfati-Saber, R., Shamma, J.S.: Consensus filters for sensor networks and distributed sensor fusion. In: 44th IEEE Conference on Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC’05, pp. 6698–6703. IEEE (2005)

    Google Scholar 

  13. Olfati-Saber, R., Fax, A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95(1), 215–233 (2007)

    Article  MATH  Google Scholar 

  14. Sabattini, L., Chopra, N., Secchi, C.: Decentralized connectivity maintenance for cooperative control of mobile robotic systems. Int. J. Robot. Res. 32(12), 1411–1423 (2013)

    Article  Google Scholar 

  15. Tran, T.M.D., Kibangou, A.Y.: Consensus-based distributed estimation of Laplacian eigenvalues of undirected graphs. In: 12th Biannual European Control Conference (ECC 2013), pp. 227–232 (2013)

    Google Scholar 

  16. Yang, P., Freeman, R.A., Gordon, G.J., Lynch, K.M., Srinivasa, S.S., Sukthankar, R.: Decentralized estimation and control of graph connectivity for mobile sensor networks. Automatica 46(2), 390–396 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Zareh, M.: Consensus in multi-agent systems with time-delays. Ph.D. thesis, University of Cagliari (2015)

    Google Scholar 

  18. Zareh, M., Seatzu, C., Franceschelli, M.: Consensus of second-order multi-agent systems with time delays and slow switching topology. In: 2013 10th IEEE International Conference on Networking, Sensing and Control (ICNSC), pp. 269–275 (2013). https://doi.org/10.1109/ICNSC.2013.6548749

  19. Zareh, M., Seatzu, C., Franceschelli, M.: Consensus on the average in arbitrary directed network topologies with time-delays. In: 4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, pp. 342–347 (2013). https://doi.org/10.3182/20130925-2-DE-4044.00022

    Article  Google Scholar 

  20. Zareh, M., Dimarogonas, D.V., Franceschelli, M., Johansson, K.H., Seatzu, C.: Consensus in multi-agent systems with non-periodic sampled-data exchange and uncertain network topology. In: 2014 International Conference on Control, Decision and Information Technologies (CoDIT), pp. 411–416. IEEE (2014)

    Google Scholar 

  21. Zareh, M., Dimarogonas, D.V., Franceschelli, M., Johansson, K.H., Seatzu, C.: Consensus in multi-agent systems with second-order dynamics and non-periodic sampled-data exchange. In: Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA), pp. 1–8. IEEE (2014)

    Google Scholar 

  22. Zareh, M., Secchi, C., Sabattini, L.: Decentralized biconnectivity conditions in multi-robot systems. In: IEEE International Conference on Decision and Control (CDC). IEEE (2016)

    Google Scholar 

  23. Zareh, M., Secchi, C., Sabattini, L.: Enforcing biconnectivity in multi-robot systems. In: IEEE International Conference on Decision and Control (CDC). IEEE (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lorenzo Sabattini .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Zareh, M., Sabattini, L., Secchi, C. (2018). Distributed Laplacian Eigenvalue and Eigenvector Estimation in Multi-robot Systems. In: Groß, R., et al. Distributed Autonomous Robotic Systems. Springer Proceedings in Advanced Robotics, vol 6. Springer, Cham. https://doi.org/10.1007/978-3-319-73008-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73008-0_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73006-6

  • Online ISBN: 978-3-319-73008-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics