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

Distributed time-varying constrained optimisation for multi-agent systems: theory and application

Author

Listed:
  • Piaoyi Su
  • Peixuan Shu
  • Jianglong Yu
  • Xiwang Dong
  • Zhang Ren
  • Danwei Wang

Abstract

In this paper, a distributed time-varying constrained optimisation problem is investigated for multi-agent system. A specified-time practical consensus approach is presented to deal with the considered problem. First, distributed continuous-time algorithms with consensus part and optimal part are proposed. In consensus part, practical specified-time convergence algorithm coupled with a Hessian-dependent gain is presented. In optimal part, a penalty-based method is provided to address the nonlinear inequality constraints. Then, by designing the Hessian-dependent gain, the effects of the nonuniform Hessian matrix of the penalised cost function can be eliminated. Based on this algorithm, the state consensus agreement is realised within a desired time, and the system can realise the asymptotical tracking of the optimal solution. Thirdly, the specified-time convergence and the asymptotic optimality of the system are proved using Lyapunov arguments. Finally, the effectiveness of the proposed algorithms is demonstrated by the results of numerical simulation and experiment.

Suggested Citation

  • Piaoyi Su & Peixuan Shu & Jianglong Yu & Xiwang Dong & Zhang Ren & Danwei Wang, 2025. "Distributed time-varying constrained optimisation for multi-agent systems: theory and application," International Journal of Systems Science, Taylor & Francis Journals, vol. 56(11), pages 2779-2794, August.
    • Handle: RePEc:taf:tsysxx:v:56:y:2025:i:11:p:2779-2794
    DOI: 10.1080/00207721.2025.2456005
    as

    Download full text from publisher

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

    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:56:y:2025:i:11:p:2779-2794. 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.