Skip to main content

On the Bipartite Consensus of Higher-Order Multi-agent Systems with Antagonistic Interactions and Switching Topologies

  • Chapter
  • First Online:
Emerging Applications of Control and Systems Theory

Abstract

In this paper we, investigate the bipartite consensus of higher-order multi-agent systems, by assuming that the interactions among agents are either cooperative or antagonistic and that the communication graph switches among a finite number of possible configurations. We first show that the “lifting approach”, proposed in [3] to model opinion dynamics in case of antagonistic interactions and agents modeled as integrators, can be extended to the case of higher order multi-agent systems with cooperative/antagonistic interactions and switching topologies. Subsequently, we are able to translate the bipartite consensus problem into a consensus problem among cooperative agents with switching topologies. This allows us to make use of the results obtained in [13] and hence to solve the bipartite consensus problem.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

Notes

  1. 1.

    This means that there may be a zero-measure set of initial conditions for which all agents’ states converge to zero.

References

  1. Altafini, C.: Consensus problems on networks with antagonistic interactions. IEEE Trans. Aut. Contr. 58, 935–946 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  2. Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, Cambridge (2010)

    Google Scholar 

  3. Hendrickx, J.M.: A lifting approach to models of opinion dynamics with antagonisms. In: Proceedings of the 53th IEEE Conference on Decision and Control, Los Angeles, USA, pp. 2118–2123. (2014)

    Google Scholar 

  4. Hou, Y., Li, J., Pan, Y.: On the Laplacian eigenvalues of signed graphs. Linear and Multilinear Algebra 51, 21–30 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Jadbabaie, A., Lin, J., Morse, A.S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Aut. Contr. 48, 988–1001 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Liberzon, D.: Switching in Systems and Control. Volume in series Systems and Control: Foundations and Applications, Birkhauser, Boston (MA) (2003)

    Google Scholar 

  7. Lin, Z.: Coupled dynamic systems: from structure towards stability and stabilizability. Ph. D. thesis, University of Toronto, Toronto, Canada (2005)

    Google Scholar 

  8. Meng, Z., Shi, G., Johansson, K.H., Cao, M., Hong, Y.: Behaviors of networks with antagonistic interactions and switching topologies. arXiv:1402.2766v2 (2016)

  9. Mohar, B.: The Laplacian spectrum of graphs. Graph Theory Comb. Appl. 2, 871–898 (1991)

    MathSciNet  MATH  Google Scholar 

  10. Ren, W., Beard, R.W.: Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Trans. Aut. Contr. 50, 655–661 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ren, W., Beard, R.W., McLain, T.W.: Coordination variables and consensus building in multiple vehicle systems. In: Leonard, N.E., Kumar, V., Morse A.S. (eds.) Cooperative Control. Lecture Notes in Control and Information Sciences, vol. 309, pp. 171–188. Springer (2004)

    Google Scholar 

  12. Shi, G., Proutiere, A., Johansson, M., Baras, J.S., Johansson, K.H.: Emergent behaviors over signed random dynamical networks: state-flipping model. IEEE Trans. Contr. Netw. Syst. 2, 142–153 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  13. Su, Y., Huang, J.: Stability of a class of linear switching systems with applications to two consensus problems. IEEE Trans. Aut. Contr. 57, 1420–1430 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  14. Valcher, M.E., Misra, P.: On the consensus and bipartite consensus in high-order multi-agent dynamical systems with antagonistic interactions. Syst. Control Lett. 66, 94–103 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  15. Wen, G., Duan, Z., Chen, G., Yu, W.: Consensus tracking of multi-agent systems with Lipschitz-type node dynamics and switching topologies. IEEE Trans. Circ. Syst. I: Regul. Pap. 61, 499–511 (2014)

    MathSciNet  Google Scholar 

  16. Xia, W., Cao, M., Johansson, K.H.: Structural balance and opinion separation in trust-mistrust social networks. IEEE Trans. Contr. Netw. Sys. 3, 46–56 (2016)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maria Elena Valcher .

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

Valcher, M.E., Misra, P. (2018). On the Bipartite Consensus of Higher-Order Multi-agent Systems with Antagonistic Interactions and Switching Topologies. In: Tempo, R., Yurkovich, S., Misra, P. (eds) Emerging Applications of Control and Systems Theory. Lecture Notes in Control and Information Sciences - Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-67068-3_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67068-3_26

  • Published:

  • Publisher Name: Springer, Cham

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

  • Online ISBN: 978-3-319-67068-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics