IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v30y2019i07ns0129183119400011.html
   My bibliography  Save this article

Distributed impulsive consensus of nonlinear multi-agent systems with input saturation

Author

Listed:
  • Xiaolu Liu

    (School of Artificial Intelligence and Automation, Huazhong University of Science and Technology, Wuhan 430074, P. R. China2Key Laboratory of Image Processing and Intelligent Control (Huazhong University of Science and Technology), Ministry of Education, Wuhan 430074, P. R. China)

  • Duxin Chen

    (School of Mathematics, Southeast University, Nanjing, 211189, P. R. China)

  • Yan-Wu Wang

    (School of Artificial Intelligence and Automation, Huazhong University of Science and Technology, Wuhan 430074, P. R. China2Key Laboratory of Image Processing and Intelligent Control (Huazhong University of Science and Technology), Ministry of Education, Wuhan 430074, P. R. China)

Abstract

This paper investigates the leader-follower exponential consensus problem of a class of Lipschitz nonlinear multi-agent systems (MASs) with input saturation. Since each agent has nonlinear dynamics, the system is not asymptotically null controllable with bounded controls. Therefore, the widely-used low-gain feedback method for designing consensus protocols of MASs with input saturation can no longer work. Taking advantage of the stability theory of impulsive systems and features of the Laplacian matrix, and combining the properties of convex hull, a distributed impulsive consensus protocol is proposed. Still, the shape reference set is introduced to assess the attraction domain of leader–follower MASs. Finally, a numerical experiment validates the effectiveness of the proposed anti-saturation impulsive consensus algorithm.

Suggested Citation

  • Xiaolu Liu & Duxin Chen & Yan-Wu Wang, 2019. "Distributed impulsive consensus of nonlinear multi-agent systems with input saturation," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 30(07), pages 1-13, July.
    • Handle: RePEc:wsi:ijmpcx:v:30:y:2019:i:07:n:s0129183119400011
    DOI: 10.1142/S0129183119400011
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183119400011
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183119400011?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:wsi:ijmpcx:v:30:y:2019:i:07:n:s0129183119400011. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.