This paper investigates the mean square consensus problem of dynamical networks of leader-following multi-agent systems with measurement noises and time-varying delays. We consider that the fixed undirected communication topologies are connected. A neighbor-based tracking algorithm together with distributed estimators are presented. Using tools of algebraic graph theory and the Gronwall-Bellman-Halanay type inequality, we establish sufficient conditions to reach consensus in mean square sense via the proposed consensus protocols. Finally, a numerical simulation is provided to demonstrate the effectiveness of the obtained theoretical result.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1016/j.isatra.2017.07.015 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!