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

Distributed fixed-time cluster optimisation for multi-agent systems

Author

Listed:
  • Suna Duan
  • Zhiyong Yu
  • Da Huang
  • Haijun Jiang

Abstract

This paper considers the distributed cluster optimisation problem of multi-agent systems (MASs). Different from existing optimisation problems, the MASs are divided into several clusters, and each cluster has its own optimisation objective which is the sum of their local objective functions. Firstly, based on communication topology, the distributed optimisation problem with two clusters is considered and a kind of distributed control protocol is proposed. By using the fixed-time stability theory and the convexity of function, it is proved that the MASs can not only achieve cluster consensus in a fixed-time interval, but also solve the optimisation problem asymptotically. Secondly, the MASs with multiple clusters are further considered. We extend the proposed protocol to a more general case and also prove that MASs can achieve cluster consensus in fixed-time and asymptotically reach the optimal solution of the optimisation objective. Finally, some numerical simulations are presented to show the efficacy of the theoretical results.

Suggested Citation

  • Suna Duan & Zhiyong Yu & Da Huang & Haijun Jiang, 2023. "Distributed fixed-time cluster optimisation for multi-agent systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 54(3), pages 531-548, February.
    • Handle: RePEc:taf:tsysxx:v:54:y:2023:i:3:p:531-548
    DOI: 10.1080/00207721.2022.2132545
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2022.2132545
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2022.2132545?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:54:y:2023:i:3:p:531-548. 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.