Abstract
In this paper, we study the consensus problem of multi-agent networks subject to communication constrains. Undirected and weighted network is considered here. Two types of communication constrains are discussed in this paper: i) each agent can only exchange quantized data with its neighbors and ii) each agent can only obtain the delayed information from its neighbors. The main contribution of this paper is to provide a precise mathematical treatment for the continuous multi-agent network with quantization and time delay. The existence of a global solution to the resulting system is firstly proved in the Filippov sense and then we prove that the solution converges to a practical consensus set asymptotically. Here, practicalconsensus means that the final consensus values are bounded within an interval, but not a value. Further, an explicit relationship among time delay, quantization parameter and the practical consensus set are theoretically presented. Numerical examples are finally given to demonstrate the effectiveness of the obtained theoretical results. © 2013 IEEE.
| Original language | English |
|---|---|
| Article number | 6485002 |
| Pages (from-to) | 2668-2678 |
| Journal | IEEE Transactions on Circuits and Systems I: Regular Papers |
| Volume | 60 |
| Issue number | 10 |
| Online published | 22 Mar 2013 |
| DOIs | |
| Publication status | Published - Oct 2013 |
Research Keywords
- Consensus
- multi-agent networks
- quantization
- time delay
Fingerprint
Dive into the research topics of 'A unified approach to practical consensus with quantized data and time delay'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver