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

Data-driven bipartite synchronization control of multi-agent systems with asymmetric input saturation over switching networks

Author

Listed:
  • Shen, Ziwen
  • Dong, Tao
  • Huang, Tingwen

Abstract

This paper addresses the bipartite synchronization (BS) issue of nonlinear discrete-time multi-agent systems (NDTMASs) with asymmetric input saturation in switching cooperative-competitive networks. First, a local neighborhood error system (LNES) is constructed based on the switching cooperative-competitive networks. By utilizing a hyperbolic function, we design a novel local cost function and derive an optimal control policy. Based on this control policy, we construct a novel saturation-input policy iteration (SIPI) technique. Furthermore, we establish the convergence of the SIPI algorithm. It is demonstrated that the LNES can converge to zero, and thus the BS problem for MASs can be solved. To implement the SIPI algorithm, a control framework based on an actor-critic architecture is constructed. To achieve asymmetric input saturation, we select an asymmetric constrained function as the activation function for the actor network. Finally, an example is presented to illustrate the reliability of our approach.

Suggested Citation

  • Shen, Ziwen & Dong, Tao & Huang, Tingwen, 2025. "Data-driven bipartite synchronization control of multi-agent systems with asymmetric input saturation over switching networks," Applied Mathematics and Computation, Elsevier, vol. 494(C).
    • Handle: RePEc:eee:apmaco:v:494:y:2025:i:c:s0096300325000074
    DOI: 10.1016/j.amc.2025.129280
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325000074
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129280?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.

    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:apmaco:v:494:y:2025:i:c:s0096300325000074. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.