2019
DOI: 10.5687/sss.2019.117 View full text |Buy / Rent full text
|
|

Abstract: A stochastic weighted averaging consensus algorithm is considered for a multi-agent system over a noisy unbalanced directed network. The convergence of the algorithm is investigated, which gives an explicit relation between the number of iterations and the closeness of the agreement, i.e., a stopping rule.

Help me understand this report

Search citation statements

Order By: Relevance
Select...
1
0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

0
1
0
Order By: Relevance
“…Finally, we conclude this paper in Section 5. The preliminary versions of this study were presented at conferences [14], [15], where unweighted graphs are considered. On the other hand, the present paper deals with general weighted graphs, where it is shown that the stopping rules can be basically the same, and thus introducing the weights does not affect the computational complexity of the consensus algorithms.…”
Section: Introductionmentioning
Create an account to read the remaining citation statements from this report. You will also get access to:
  • Search over 1b+ citation statments to see what is being said about any topic in the research literature
  • Advanced Search to find publications that support or contrast your research
  • Citation reports and visualizations to easily see what publications are saying about each other
  • Browser extension to see Smart Citations wherever you read research
  • Dashboards to evaluate and keep track of groups of publications
  • Alerts to stay on top of citations as they happen
  • Automated reference checks to make sure you are citing reliable research in your manuscripts
  • 14 day free preview of our premium features.

Trusted by researchers and organizations around the world

Over 100,000 students researchers, and industry experts at use scite

See what students are saying

rupbmjkragerfmgwileyiopcupepmcmbcthiemesagefrontiersapsiucrarxivemeralduhksmucshluniversity-of-gavle
“…Finally, we conclude this paper in Section 5. The preliminary versions of this study were presented at conferences [14], [15], where unweighted graphs are considered. On the other hand, the present paper deals with general weighted graphs, where it is shown that the stopping rules can be basically the same, and thus introducing the weights does not affect the computational complexity of the consensus algorithms.…”
Section: Introductionmentioning