Loading…
Periodic event-triggered consensus of multi-agent systems under directed topology
The event-triggered consensus problems of multi-agent systems without and with time delay under directed topology are investigated, respectively. The event-checkings are only implemented at periodic time instants. Under the designed consensus algorithm, the sampling period is permitted to be arbitra...
Saved in:
Published in: | Neurocomputing (Amsterdam) 2020-04, Vol.385, p.33-41 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The event-triggered consensus problems of multi-agent systems without and with time delay under directed topology are investigated, respectively. The event-checkings are only implemented at periodic time instants. Under the designed consensus algorithm, the sampling period is permitted to be arbitrarily large. Another advantage of the designed consensus algorithm is that, for systems with time delay, consensus can be achieved for any finite delay only with the requirement that it is bounded by the sampling period. The case of strongly connected topology is first investigated. Then, the result is extended to the most general topology which only needs to contain a spanning tree. A novel method based on positive series is introduced to analyze the convergence of the closed-loop systems. A numerical example is provided to illustrate the effectiveness of the obtained theoretical results. |
---|---|
ISSN: | 0925-2312 1872-8286 |
DOI: | 10.1016/j.neucom.2019.12.081 |