Skip to main content

Guaranteed Cost Formation Control for Linear Multi-agent Systems with Switching Topologies

  • Conference paper
  • First Online:
Intelligent Robotics and Applications (ICIRA 2021)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 13013))

Included in the following conference series:

  • 3579 Accesses

Abstract

Guaranteed-cost formation problem for linear multi-agent systems with switching topologies is investigated. The guaranteed cost formation problem is transformed into a guaranteed cost control problem of an reduced-order switched systems equivalently by a linear transformation. Then, a necessary and sufficient condition for guaranteed cost formation is proposed. Moreover, based on an average dwell time scheme, a sufficient condition for the guaranteed cost formation of linear multi-agent system with switching topologies are presented in terms of linear matrix inequality techniques, and an upper bound of the guaranteed cost function is given. Finally, a numerical example is given to demonstrate the effectiveness of the theoretical results.

This work is supported by Beijing Municipal Science and Technology Project (KM202011417004), Special Research Projects of Beijing Union University (ZK30202002), Beijing Nova Program (Z201100006820101), Science and Technology Program of Beijing Municipal Education Commission (KM201811417001), 2021 “Star” College Students Science and Technology Innovation and Entrepreneurship Project (20211010,20212038).

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 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Consolini, L., Morbidi, F., Prattichizzo, D., Tosques, M.: Leader-follower formation control of nonholonomic mobile robots with input constraints. Automatica 44(5), 1343–1349 (2008)

    Article  MathSciNet  Google Scholar 

  2. Lewis, M.A., Tan, K.H.: High precision formation control of mobile robots using virtual structures. Auton. Robots 4(4), 387–403 (1997). https://doi.org/10.1023/A:1008814708459

    Article  Google Scholar 

  3. Balch, T., Arkin, R.C.: Behavior-based formation control for multirobot teams. IEEE Trans. Robot. Autom. 14(6), 926–939 (1998)

    Article  Google Scholar 

  4. Ren, W., Sorensen, N.: Distributed coordination architecture for multi-robot formation control. Robot. Autonom. Syst. 56(4), 324–333 (2008)

    Google Scholar 

  5. Zhou, Y., Dong, X., Lu, G., et al.: Time-varying formation control for unmanned aerial vehicles with switching interaction topologies. In: International Conference on Unmanned Aircraft Systems, pp. 1203–1209 (2014)

    Google Scholar 

  6. Zhang, Y.: Consensus of multiagent with time delays under switching topologies and the applications in formation. Beijing University of Technology, pp. 81–106 (2016)

    Google Scholar 

  7. Zhang, Y., Chen, Y., Qu, X.: Design of topology switching law for formation problem of linear multi-agent systems with time-varying delay. In: Proceedings of Chinese Control Conference, pp. 7115–7120 (2016)

    Google Scholar 

  8. Wang, Z., Liu, G., Xi, J., et al.: Guaranteed cost formation control for multi-agent systems: consensus approach. In: Proceedings of the 34th Chinese Control Conference, pp. 7309–7314 (2015)

    Google Scholar 

  9. Wang, L., Xi, J., Yuan, M., Liu, G.: Guaranteed-performance time-varying formation control for swarm systems subjected to communication constraints. IEEE Access 6, 45384–45393 (2018)

    Article  Google Scholar 

  10. Jin, J., Li, J., Wang, L., et al.: Energy-constraint output formation for networked systems with random communication silence and switching topologies. IEEE Access 99, 1–12 (2021)

    Google Scholar 

  11. Xi, J., Yu, Y., Liu, G., et al.: Guaranteed-cost consensus for singular multi-agent systems with switching topologies. IEEE Trans. Circ. Syst. I Regular Papers 61(5), 1531–1542 (2017)

    Article  MathSciNet  Google Scholar 

  12. Xi, J., Yang, X., Yu, Z., et al.: Leader-follower guaranteed-cost consensualization for high-order linear swarm systems with switching topologies. J. Franklin Inst. 352(4), 1343–1363 (2015)

    Article  Google Scholar 

  13. Xi, J., Fan, Z., Liu, H., et al.: Guaranteed-cost consensus for multiagent networks with Lipschitz nonlinear dynamics and switching topologies. Int. J. Robust Nonlinear Control 28, 2841–2852 (2018)

    Google Scholar 

  14. Hespanha, J.P., Morse, A.S.: Stability of switched systems with average dwell-time. In: Proceeding of the 38th IEEE Conference on Decision and Control, pp. 2655–2660 (1999)

    Google Scholar 

  15. Liu, S.: Schur Complement, Encyclopedia of Statistical Sciences (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yaxiao Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, Y., Huang, N., Tong, S., Zheng, B. (2021). Guaranteed Cost Formation Control for Linear Multi-agent Systems with Switching Topologies. In: Liu, XJ., Nie, Z., Yu, J., Xie, F., Song, R. (eds) Intelligent Robotics and Applications. ICIRA 2021. Lecture Notes in Computer Science(), vol 13013. Springer, Cham. https://doi.org/10.1007/978-3-030-89095-7_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-89095-7_46

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-89094-0

  • Online ISBN: 978-3-030-89095-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics