IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v503y2025ics0096300325002243.html
   My bibliography  Save this article

Prescribed-time distributed resource allocation algorithm for heterogeneous linear multi-agent networks with unbalanced directed communication

Author

Listed:
  • Lian, Yuxiao
  • Zhang, Baoyong
  • Yuan, Deming
  • Yao, Yao
  • Song, Bo

Abstract

In this paper, a prescribed-time distributed algorithm is proposed to solve the resource allocation problem among the heterogeneous linear multi-agent systems over unbalanced directed networks. First, an estimator with prescribed-time convergence performance is designed to cope with the asymmetry of the unbalanced network topology. Then, a novel prescribed-time convergence result that features an adjustable convergence rate is developed. Based on this result, it is shown that the algorithm developed in this paper ensures the agents' outputs accurately reach the optimal solution within a prescribed-time and they are maintained at the optimum thereafter. Furthermore, a parameter selection rule is formulated to reflect the low conservatism of the algorithm. This indicates that the parameters affecting the convergence speed of the algorithm are not necessary to rely on the global information. Finally, the performance of the proposed algorithm is illustrated through simulations.

Suggested Citation

  • Lian, Yuxiao & Zhang, Baoyong & Yuan, Deming & Yao, Yao & Song, Bo, 2025. "Prescribed-time distributed resource allocation algorithm for heterogeneous linear multi-agent networks with unbalanced directed communication," Applied Mathematics and Computation, Elsevier, vol. 503(C).
    • Handle: RePEc:eee:apmaco:v:503:y:2025:i:c:s0096300325002243
    DOI: 10.1016/j.amc.2025.129498
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325002243
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129498?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.

    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:eee:apmaco:v:503:y:2025:i:c:s0096300325002243. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.