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

A data-driven α-policy iteration algorithm for optimal leader-following consensus of discrete-time multi-agent systems

Author

Listed:
  • Aoxue Xiang
  • Xinyuan Zhao
  • Ruicheng Ma

Abstract

In this paper, the data-driven α-policy iteration (PI) algorithm is proposed to address the optimal leader-following consensus problem of discrete-time multi-agent systems (MASs). Unlike existing results for state consensus problem that utilise the PI algorithm, the novel algorithm leverages only the system's trajectory from historical data over a finite number of steps and and does not require an admissible initial policy. Firstly, the linear quadratic regulator (LQR) design method is applied to derive the Bellman equation and the control policy based on the available measured data. Then, the data-driven α-PI algorithm is introduced, demonstrating a convergence rate that outperforms the value iteration (VI) algorithm and enabling all follower agents to track the trajectory of the leader agent. Finally, two examples are presented to demonstrate the performance of the proposed method.

Suggested Citation

  • Aoxue Xiang & Xinyuan Zhao & Ruicheng Ma, 2025. "A data-driven α-policy iteration algorithm for optimal leader-following consensus of discrete-time multi-agent systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 56(16), pages 4055-4072, December.
    • Handle: RePEc:taf:tsysxx:v:56:y:2025:i:16:p:4055-4072
    DOI: 10.1080/00207721.2025.2482006
    as

    Download full text from publisher

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