Consensus in noisy environments with switching topology and time-varying delays
Yongzheng Sun,
Donghua Zhao and
Jiong Ruan
Physica A: Statistical Mechanics and its Applications, 2010, vol. 389, issue 19, 4149-4161
Abstract:
In this paper, the leader-following consensus problem of noise perturbed multi-agent systems with time-varying delays is investigated. We analyze two different cases of coupling topologies: fixed topology and switching topology. Based on the Lyapunov functional and combining with the linear matrix inequality (LMI) approach, it is analytically proved that the consensus could be achieved almost surely with the perturbation of noise and communication time delays. Furthermore, numerical examples are provided to illustrate the effectiveness of the theoretical results. The simulation results show that the speed of convergence in environments with relatively strong noise intensity is lower than that in environments with relatively weak noise intensity.
Keywords: Consensus problems; Multi-agent systems; Time delays; White noise (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437110004681
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:389:y:2010:i:19:p:4149-4161
DOI: 10.1016/j.physa.2010.05.038
Access Statistics for this article
Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis
More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().