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

Heterogeneous optimal formation control of nonlinear multi-agent systems with unknown dynamics by safe reinforcement learning

Author

Listed:
  • Golmisheh, Fatemeh Mahdavi
  • Shamaghdari, Saeed

Abstract

This article presents the problem of distributed training with a decentralized execution policy as a safe, optimal formation control for a heterogeneous nonlinear multi-agent system. The control objective is to guarantee safety while achieving optimal performance. This objective is achieved by introducing novel distributed optimization problems with cost and local control barrier functions (CBFs). Designing an optimal formation controller is defined as optimal performance and modeled by a cost function. A local CBF trains a safe controller to ensure multi-agent systems operate within the safe regions. Instead of optimizing constrained optimization problems, this method generates safe, optimal controllers from unconstrained optimization problems by utilizing local CBFs. As a result, the presented approach has a lower computational cost than constrained optimization problems. It is proven that the proposed controller's optimality and stability are not affected by adding the local CBF to the cost function. A safe, optimal policy is iteratively derived using a new off-policy multi-agent reinforcement learning (MARL) algorithm that does not need knowledge of the agents' dynamics. Finally, the effectiveness of the proposed algorithm is evaluated through simulation of the collision-free problem of the multi-quadrotor formation control.

Suggested Citation

  • Golmisheh, Fatemeh Mahdavi & Shamaghdari, Saeed, 2024. "Heterogeneous optimal formation control of nonlinear multi-agent systems with unknown dynamics by safe reinforcement learning," Applied Mathematics and Computation, Elsevier, vol. 460(C).
  • Handle: RePEc:eee:apmaco:v:460:y:2024:i:c:s009630032300471x
    DOI: 10.1016/j.amc.2023.128302
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630032300471X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2023.128302?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yue, Yuanyuan & Liu, Qingshan, 2024. "Distributed dual consensus algorithm for time-varying optimization with coupled equality constraint," Applied Mathematics and Computation, Elsevier, vol. 474(C).

    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:460:y:2024:i:c:s009630032300471x. 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.