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

Safe reinforcement learning for cooperative tracking consensus problem of discrete-time multiagent systems with control barrier functions

Author

Listed:
  • Shihan Liu
  • Zhen Yu
  • Dongxu Gao

Abstract

The cooperative tracking consensus problem for discrete-time multiagent systems (MASs) with state and input constraints is addressed by a novel safe reinforcement learning (RL) algorithm. In MASs, all agents communicate through a directed communication graph. The algorithm is developed within the policy iteration (PI) framework, relying solely on measured data from the system trajectories in the environment. Additionally, the reward functions are enhanced by the integration of control barrier functions (CBFs) and input constraint functions. The iterative value function’s monotonically non-increasing feature guarantees that the safe set stays forward invariant inside the PI framework. Furthermore, theoretical proofs are provided to establish both safety and convergence. The algorithm’s design and implementation are elaborated through neural networks. Finally, experiment results validate the efficacy and safety of the proposed algorithm.

Suggested Citation

  • Shihan Liu & Zhen Yu & Dongxu Gao, 2025. "Safe reinforcement learning for cooperative tracking consensus problem of discrete-time multiagent systems with control barrier functions," International Journal of Systems Science, Taylor & Francis Journals, vol. 56(12), pages 2889-2909, September.
  • Handle: RePEc:taf:tsysxx:v:56:y:2025:i:12:p:2889-2909
    DOI: 10.1080/00207721.2025.2461016
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2025.2461016
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2025.2461016?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:12:p:2889-2909. 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.