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

Event-triggered zero-gradient-sum distributed optimisation algorithm with time-varying communication delays

Author

Listed:
  • Jiayun Liu
  • Jin Xie

Abstract

This paper addresses an event-triggered distributed convex optimisation problem over networks with time-varying delays. The communication between agents is triggered by conditions monitored by nodes. The proposed triggering condition is decentralised and does not require continuous communications among agents to calculate the threshold. By constructing a new Lyapunov–Krasovskii function, the optimisation problem is solved, and the explicit sufficient condition for the maximum admissible time delay is derived. Moreover, the Zeno behaviour of the closed-loop system is excluded. Finally, a simulation example is provided to verify the results obtained in this paper.

Suggested Citation

  • Jiayun Liu & Jin Xie, 2021. "Event-triggered zero-gradient-sum distributed optimisation algorithm with time-varying communication delays," International Journal of Systems Science, Taylor & Francis Journals, vol. 52(1), pages 110-125, January.
    • Handle: RePEc:taf:tsysxx:v:52:y:2021:i:1:p:110-125
    DOI: 10.1080/00207721.2020.1820622
    as

    Download full text from publisher

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