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

Yuezu Lv; Zhongkui Li

doi:10.1007/s11432-020-3129-1

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

Yuezu Lv^*
, Zhongkui Li

^*Corresponding author for this work

Research output: Contribution to journal › Letter › peer-review

20 Citations (Scopus)

Abstract

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.

Original language	English
Article number	189203
Journal	Science China Information Sciences
Volume	65
Issue number	8
DOIs	https://doi.org/10.1007/s11432-020-3129-1
Publication status	Published - Aug 2022
Externally published	Yes

Access to Document

10.1007/s11432-020-3129-1

Cite this

@article{8ce88889d2684ff7ae9b8b17b20dd062,

title = "Is fully distributed adaptive protocol applicable to graphs containing a directed spanning tree?",

abstract = "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.",

author = "Yuezu Lv and Zhongkui Li",

note = "Publisher Copyright: {\textcopyright} 2021, Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature.",

year = "2022",

month = aug,

doi = "10.1007/s11432-020-3129-1",

language = "English",

volume = "65",

journal = "Science China Information Sciences",

issn = "1674-733X",