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

Robust iterative learning protocols for finite-time consensus of multi-agent systems with interval uncertain topologies

Author

Listed:
  • Deyuan Meng
  • Yingmin Jia
  • Junping Du

Abstract

This paper is devoted to the robust finite-time output consensus problems of multi-agent systems under directed graphs, where all agents and their communication topologies are subject to interval uncertainties. Distributed protocols are constructed by using iterative learning control (ILC) algorithms, where information is exchanged only at the end of one iteration and learning is used to update the control inputs after each iteration. It is proved that under ILC-based protocols, the finite-time consensus can be achieved with an increasing number of iterations if the communication network of agents is guaranteed to have a spanning tree. Moreover, if the information of any desired terminal output is available to a portion (not necessarily all) of the agents, then the consensus output that all agents finally reach can be enabled to be the desired terminal output. It is also proved that for all ILC-based protocols, gain selections can be provided in terms of bound values, and consensus conditions can be developed associated with bound matrices. Simulation results are given to demonstrate the effectiveness of our theoretical results.

Suggested Citation

  • Deyuan Meng & Yingmin Jia & Junping Du, 2015. "Robust iterative learning protocols for finite-time consensus of multi-agent systems with interval uncertain topologies," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(5), pages 857-871, April.
    • Handle: RePEc:taf:tsysxx:v:46:y:2015:i:5:p:857-871
    DOI: 10.1080/00207721.2013.798445
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2013.798445
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2013.798445?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:46:y:2015:i:5:p:857-871. 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.