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

Consensus in multi-agent systems subject to input saturation and time-varying delays

Author

Listed:
  • Thales C. Silva
  • Fernando O. Souza
  • Luciano C. A. Pimenta

Abstract

This paper deals with the problem of consensus in multi-agent systems. The consensus is investigated considering directed networks composed by identical agents described by linear models of arbitrary order, subject to input saturation and non-uniform time-varying delays. The main results are sufficient conditions for consensus analysis and design of distributed consensus protocols for multi-agent systems. In addition, because the saturation might prevent the multi-agent system to attain consensus on some set of initial conditions, it is also proposed a strategy to calculate a region in which the consensus is guaranteed. The results follow from the Lyapunov–Krasovskii theory and are formulated in the linear matrix inequalities (LMIs) framework. Finally, we present examples to illustrate the effectiveness of the proposed method in contrast with similar approaches existing in the literature.

Suggested Citation

  • Thales C. Silva & Fernando O. Souza & Luciano C. A. Pimenta, 2021. "Consensus in multi-agent systems subject to input saturation and time-varying delays," International Journal of Systems Science, Taylor & Francis Journals, vol. 52(7), pages 1479-1498, May.
    • Handle: RePEc:taf:tsysxx:v:52:y:2021:i:7:p:1479-1498
    DOI: 10.1080/00207721.2020.1860267
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2020.1860267
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2020.1860267?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:52:y:2021:i:7:p:1479-1498. 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.