2020
DOI: 10.9746/jcmsi.13.274
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Stochastic consensus algorithms are considered for multi-agent systems over noisy unbalanced directed networks. The graph which represents a communication network of the system is assumed to contain a directed spanning tree, that is, a given digraph is weakly connected. Then two types of stochastic consensus are investigated, where one is for the agent states themselves and the other is for the time averages of the agent states. The convergence of the algorithms is investigated, which gives a stopping rule, i.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 14 publications
0
0
0
Order By: Relevance