Leader-following coordination of multi-agent systems with coupling time delays

By Jiangping Hu, Yiguang Hong. 2007

943 citations recorded by the source corpus.

In this paper, we consider a leader-following consensus problem of a group of autonomous agents with time-varying coupling delays. Two different cases of coupling topologies are investigated. At first, a necessary and sufficient condition is proved in the case when the interconnection topology is fixed and directed. Then a sufficient condition is proposed in the case when the coupling topology is switched and balanced. Numerical examples are also given to illustrate our results.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/19da8e8496daa8c5307af0bd9f9702c62546c219

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Wei Ren
2. Guanrong Chen
3. Long Wang
4. Wenwu Yu
5. Yongcan Cao
6. Yongnan Jia
7. Ziyang Meng
8. Qing-Long Han

Citations in the corpus

• Distributed tracking control of leader-follower multi-agent systems under noisy measurement (2011, background): “…&Beard (2005)), the roles of multiple leaders in guiding the followers (Lin , Francis , &Maggiore (2005); Shi , &Hong (2009)), the time-delayed control de-sign (Hu , &Hong (2007); Lin , Jia , et al. (2008)), and the distributed estimation strategies (Fax , &Murray (2004); Hong , Hu , &Gao (2006)).”
• Distributed finite-time tracking control for multi-agent systems: An observer-based approach (2013, neutral): “Lemma 4 ([24]).”
• Consensus of high-order dynamic multi-agent systems with switching topology and time-varying delays (2010, background): “The consensus problems for networks of singleintegrator/double-integrator agents with communication delays had been studied in [8], [15] and [19].”
• Stability of a Class of Linear Switching Systems with Applications to Two Consensus Problems (2011, background): “Lemma 3 (see in [7]): The matrix H = L + ∆ has all eigenvalues with positive real parts if and only if every node is reachable form the node 0 in Ḡ.”
• A Joint Control–Communication Design for Reliable Vehicle Platooning in Hybrid Traffic (2017, background): “In this case, matrix Hσ is positive stable according to [32].”
• Distributed Secondary Voltage and Frequency Restoration Control of Droop-Controlled Inverter-Based Microgrids (2015, background): “Let M = Lc +G , and clearly, it is a symmetric positive definite matrix [29].”
• Cooperative Output Regulation of Linear Multi-Agent Systems (2012, methodology): “Remark 2: This lemma was first established in Lemma 4 in [7] by using Geršgorin disk theorem.”
• Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs (2016, methodology): “, v0 can be accessible by vi+m if bi > 0; otherwise, bi = 0, ∀ 1 ≤ i ≤ n−m), we have the following claim: Claim 1: The digraph associated with L̂, denoted by Ĝ , has a spanning tree including v0 as its root (or equivalently, v0 is a globally reachable vertex in Ĝ [3], [6]) if and only if for every v”