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

Distributed robust adaptive flocking for uncertain nonlinear multi-agent systems with time-varying communication delay

Author

Listed:
  • Ali Izadipour
  • Jafar Ghaisari
  • Javad Askari

Abstract

This paper is concerned with the flocking problem of networked multi-agent systems while considering the perturbed communication link, time-varying communication delay and perturbed nonlinear dynamics. The state information of agents is exchanged among agents through a delayed communication network with an unknown upper bound. The proposed algorithm doesn't require the precise value of the communication delay upper bound. In addition, it can be applied to the networks with different time delays in different links. In order to deal with the perturbation of communication links, a distributed adaptive controller is proposed. The controllers are designed using only the delayed velocity information of one-hop neighbour. By means of the Lyapunov–Krasovskii analysis, sufficient conditions on the upper bound of communication delay derivative are computed under which flocking will be achieved and all states are globally uniformly bounded. Simulation results illustrate the effectiveness of the proposed algorithm.

Suggested Citation

  • Ali Izadipour & Jafar Ghaisari & Javad Askari, 2020. "Distributed robust adaptive flocking for uncertain nonlinear multi-agent systems with time-varying communication delay," International Journal of Systems Science, Taylor & Francis Journals, vol. 51(1), pages 72-86, January.
  • Handle: RePEc:taf:tsysxx:v:51:y:2020:i:1:p:72-86
    DOI: 10.1080/00207721.2019.1694196
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2019.1694196?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.

    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:51:y:2020:i:1:p:72-86. 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.