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

Event-based appointed-time cooperative formation for linear multiagent systems with actuator saturation

Author

Listed:
  • Dong, Bolei
  • Yan, Liping
  • Xia, Yuanqing

Abstract

This paper considers the time-varying formation (TVF) tracking issue of a class of multiagent systems (MASs) with input saturation. Meanwhile, the prescribed transient and steady-state performance of MASs is guaranteed. Compared to the existing prescribed performance control (PPC) approaches, the maximum convergence time of the designed algorithm is preassigned. To save network resources, an event-based protocol is introduced to achieve lower information communication frequency, where Zeno behavior is excluded. Furthermore, an improved control strategy is employed where an auxiliary system is designed to improve the performance under actuator saturation. According to Lyapunov stability theory, the expected practical TVF tracking control problem is solved for the MASs. Finally, the effectiveness of the designed schemes is demonstrated by the simulation examples.

Suggested Citation

  • Dong, Bolei & Yan, Liping & Xia, Yuanqing, 2024. "Event-based appointed-time cooperative formation for linear multiagent systems with actuator saturation," Applied Mathematics and Computation, Elsevier, vol. 477(C).
    • Handle: RePEc:eee:apmaco:v:477:y:2024:i:c:s0096300324003023
    DOI: 10.1016/j.amc.2024.128841
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324003023
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128841?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:477:y:2024:i:c:s0096300324003023. 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.