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

Distributed finite-time optimisation for multi-agent systems via event-triggered aperiodically intermittent communication

Author

Listed:
  • Feiyang Yang
  • Zhiyong Yu
  • Haijun Jiang

Abstract

In this paper, the finite-time distributed optimisation problem for multi-agent systems (MASs) is investigated by proposing a kind of new event-based aperiodically intermittent communication strategy. Firstly, the distributed optimisation problem with the sum of local objective functions is considered. A novel finite-time event-triggered intermittent control protocol is proposed over undirected networks, and some sufficient conditions are obtained to ensure the finite-time consensus of MASs and the asymptotical solvability of the optimisation problem. Secondly, a more general distributed optimisation problem, in which the optimisation objective is the convex combination of local objective functions, is considered and we also prove that MASs can achieve consensus in finite-time and asymptotically reach the optimal solution under the proposed protocol over directed networks. Finally, two numerical examples are given to demonstrate the effectiveness of the theoretical results.

Suggested Citation

  • Feiyang Yang & Zhiyong Yu & Haijun Jiang, 2022. "Distributed finite-time optimisation for multi-agent systems via event-triggered aperiodically intermittent communication," International Journal of Systems Science, Taylor & Francis Journals, vol. 53(8), pages 1674-1689, June.
    • Handle: RePEc:taf:tsysxx:v:53:y:2022:i:8:p:1674-1689
    DOI: 10.1080/00207721.2021.2019348
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2021.2019348
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2021.2019348?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:53:y:2022:i:8:p:1674-1689. 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.