IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v589y2022ics0378437121008608.html
   My bibliography  Save this article

Output feedback control for bipartite consensus of nonlinear multi-agent systems with disturbances and switching topologies

Author

Listed:
  • Parivallal, A.
  • Sakthivel, R.
  • Wang, Chao

Abstract

The bipartite consensus protocol for nonlinear multi-agent system (MAS) subject to switching interaction graphs and external disturbances is addressed in this paper. The coordination goal of this paper is to present a static output feedback control design such that the bipartite consensus of the considered MAS can be achieved with prescribed mixed H∞ and passive performance. We consider undirected structurally balanced signed network topologies to express the cooperative and competitive interaction between neighboring agents. To achieve the desired objective of this paper, the problem under consideration is first transformed into a stabilization problem by using the properties of Laplacian matrix. Then utilizing Lyapunov stability theory, the desired bipartite consensus conditions are developed for the resulting model in terms of linear matrix inequalities. Ultimately, a numerical example is provided to verify the robustness of the considered static output feedback control design.

Suggested Citation

  • Parivallal, A. & Sakthivel, R. & Wang, Chao, 2022. "Output feedback control for bipartite consensus of nonlinear multi-agent systems with disturbances and switching topologies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 589(C).
    • Handle: RePEc:eee:phsmap:v:589:y:2022:i:c:s0378437121008608
    DOI: 10.1016/j.physa.2021.126589
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437121008608
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2021.126589?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Griffin, Christopher & Squicciarini, Anna & Jia, Feiran, 2022. "Consensus in complex networks with noisy agents and peer pressure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 608(P1).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:589:y:2022:i:c:s0378437121008608. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.