Abstract
In sense of communication delays, an improved robust consensus algorithm for multi-agent networks and its the convergence rate have been investigated in this paper. Precisely, an improved weighted average prediction has been introduced to reformulate the network model into a neutral network fashion. By virtue of analyzing the Hopf bifurcation, an upper bound of the communication delay is derived for the multi-agent network, which could guarantee the network to achieve weighted average consensus. In addition, the main results show that not only can the proposed method promote the robustness but also improve its convergence rate. Finally, two numerical simulations are provided, which demonstrates the effectiveness of the method. © 2013 Springer Science+Business Media New York.
| Original language | English |
|---|---|
| Pages (from-to) | 1721-1736 |
| Journal | Circuits, Systems, and Signal Processing |
| Volume | 33 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - Jun 2014 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Convergence speed
- Multi-agent networks
- Robustness
- Weighted average consensus
Fingerprint
Dive into the research topics of 'Improved weighted average prediction for multi-agent networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver