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

Improved leaderless consenus criteria of networked multi-agent systems based on the sampled data

Author

Listed:
  • Wangli He
  • Siqi Lv
  • Chen Peng
  • Naoyuki Kubota
  • Feng Qian

Abstract

This paper is concerned with leaderless consensus of networked multi-agent systems with Lipschitz-type nonlinear dynamics based on the sampled data. By introducing a weighted average state of all nodes as the virtual leader, the error variables are defined as the distance between agents and the virtual leader. The improvements are done in two directions. First, several consensus conditions are derived by linear matrix inequalities based on Finsler's lemma instead of algebraic criteria based on the general algebraic connectivity. Finsler's lemma is utilised to deal with the linear dependence of the error variables. Second, a distributed event-triggered transmission strategy under the periodic sampling scheme is proposed to reduce the communication between agents and the control updates, which only need to check the event condition at each sampling instant, avoiding the continuous monitor. With the improved strategies, one theorem and two corollaries are derived and a co-design approach of the feedback gain and the event-triggered matrix is also presented. Finally, an example is provided to validate the effectiveness of the theoretical results.

Suggested Citation

  • Wangli He & Siqi Lv & Chen Peng & Naoyuki Kubota & Feng Qian, 2018. "Improved leaderless consenus criteria of networked multi-agent systems based on the sampled data," International Journal of Systems Science, Taylor & Francis Journals, vol. 49(13), pages 2737-2752, October.
  • Handle: RePEc:taf:tsysxx:v:49:y:2018:i:13:p:2737-2752
    DOI: 10.1080/00207721.2018.1505005
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2018.1505005?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:49:y:2018:i:13:p:2737-2752. 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.