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

Finite-time consensus protocols for networks of dynamic agents by terminal iterative learning

Author

Listed:
  • Deyuan Meng
  • Yingmin Jia
  • Junping Du

Abstract

This paper aims to address finite-time consensus problems for multi-agent systems under the iterative learning control framework. Distributed iterative learning protocols are presented, which adopt the terminal laws to update the control input and are offline feedforward design approaches. It is shown that iterative learning protocols can guarantee all agents in a directed graph to reach the finite-time consensus. Furthermore, the multi-agent systems can be enabled to achieve a finite-time consensus at any desired terminal state/output if iterative learning protocols can be improved by introducing the desired terminal state/output to a portion of agents. Simulation results show that iterative learning protocols can effectively accomplish finite-time consensus objectives for both first-order and higher order multi-agent systems.

Suggested Citation

  • Deyuan Meng & Yingmin Jia & Junping Du, 2014. "Finite-time consensus protocols for networks of dynamic agents by terminal iterative learning," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(11), pages 2435-2446, November.
    • Handle: RePEc:taf:tsysxx:v:45:y:2014:i:11:p:2435-2446
    DOI: 10.1080/00207721.2013.775380
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2013.775380
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2013.775380?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:45:y:2014:i:11:p:2435-2446. 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.