IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v54y2023i4p731-750.html
   My bibliography  Save this article

Fully distributed adaptive finite-time consensus over uncertain network topology

Author

Listed:
  • Le Zhao
  • Yungang Liu
  • Fengzhong Li

Abstract

Communication network could suffer uncertainties originating from link faults and network attacks. This situation, in multi-agent systems, can be featured by unknown weights of network topology. To impair the influence of the uncertain topology, typical compensation should be taken into account in distributed protocols to the workability of multi-agent systems. This paper, in the context of uncertain topology, addresses finite-time leader-following consensus for second-order uncertain nonlinear multi-agent systems. In addition to uncertainties in topology, the systems also allow unknown control coefficients, which together with the unknown weights renders the realisation of finite-time leader-following consensus nontrivial. Specifically, a fully distributed protocol based on distributed finite-time observer is designed via integrating the adaptive compensation scheme. Notably, in the designed protocol, dynamic high gains are introduced for the compensations of the network uncertainties and agents uncertainties. It turns out that the designed fully distributed protocol guarantees the global finite-time leader-following consensus. Simulation examples are provided to illustrate the validity of the proposed approach.

Suggested Citation

  • Le Zhao & Yungang Liu & Fengzhong Li, 2023. "Fully distributed adaptive finite-time consensus over uncertain network topology," International Journal of Systems Science, Taylor & Francis Journals, vol. 54(4), pages 731-750, March.
    • Handle: RePEc:taf:tsysxx:v:54:y:2023:i:4:p:731-750
    DOI: 10.1080/00207721.2022.2141595
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2022.2141595
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2022.2141595?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tsysxx:v:54:y:2023:i:4:p:731-750. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.