Skip to main content

Is fully distributed adaptive protocol applicable to graphs containing a directed spanning tree?


This study presented a unified framework of consensus with fully distributed adaptive protocols. It is revealed that the sufficient and necessary condition on consensus realization is that the communication graph must contain a directed spanning tree, which fills in the gap between leaderless consensus with strongly connected graphs and consensus tracking with leader-follower graphs.

This is a preview of subscription content, access via your institution.


  1. Movric K H, Lewis F L. Cooperative optimal control for multi-agent systems on directed graph topologies. IEEE Trans Automat Contr, 2014, 59: 769–774

    MathSciNet  Article  Google Scholar 

  2. Li Z, Wen G, Duan Z, et al. Designing fully distributed consensus protocols for linear multi-agent systems with directed graphs. IEEE Trans Automat Contr, 2015, 60: 1152–1157

    MathSciNet  Article  Google Scholar 

  3. Lv Y, Li Z, Duan Z, et al. Novel distributed robust adaptive consensus protocols for linear multi-agent systems with directed graphs and external disturbances. Int J Control, 2017, 90: 137–147

    MathSciNet  Article  Google Scholar 

  4. Hu J, Bhowmick P, Lanzon A. Distributed adaptive time-varying group formation tracking for multiagent systems with multiple leaders on directed graphs. IEEE Trans Control Netw Syst, 2020, 7: 140–150

    MathSciNet  Article  Google Scholar 

  5. Ma Q, Zhou G, Li E. Adaptive bipartite output consensus of heterogeneous linear multi-agent systems with antagonistic interactions. Neurocomputing, 2020, 373: 50–55

    Article  Google Scholar 

  6. Lv Y, Fu J, Wen G, et al. Fully distributed anti-windup consensus protocols for linear MASs with input saturation: the case with directed topology. IEEE Trans Cybern, 2020. doi:

  7. Wang Q, Fu J, Wang J. Fully distributed containment control of high-order multi-agent systems with nonlinear dynamics. Syst Control Lett, 2017, 99: 33–39

    MathSciNet  Article  Google Scholar 

  8. Li Z K, Duan Z S, Chen G R, et al. Consensus of multiagent systems and synchronization of complex networks: a unified viewpoint. IEEE Trans Circ Syst I, 2010, 57: 213–224

    MathSciNet  Google Scholar 

  9. Wang L, Xiao F. A new approach to consensus problems for discrete-time multiagent systems with time-delays. In: Proceedings of the 2006 American Control Conference, Minneapolis, 2006. 2118–2123

Download references


This work was supported by Beijing Natural Science Foundation (Grant No. JQ20025), National Natural Science Foundation of China (Grant Nos. 61903083, 61973006), and Natural Science Foundation of Jiangsu Province of China (Grant No. BK20190333).

Author information

Authors and Affiliations


Corresponding author

Correspondence to Yuezu Lv.

Electronic supplementary material

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Lv, Y., Li, Z. Is fully distributed adaptive protocol applicable to graphs containing a directed spanning tree?. Sci. China Inf. Sci. 65, 189203 (2022).

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: