Name
Abstract | ||
|---|---|---|
In this paper, we deal with the limiting behavior of linear consensus systems in both continuous and discrete time. A geometric framework featuring the state transition matrix of the system is introduced to: (i) generalize/rediscover the existing results in the literature about convergence properties of distributed averaging algorithms, (ii) interpret, from a consensus system point of view, the Sonin's Decomposition-Separation Theorem that has proved, as in our recent work, to be a powerful tool in asymptotic analysis of backward propagating Markov chains, and (iii) address the so-called “consensus space” of the underlying chain of a system, where by the consensus space, we mean the set of initial conditions leading to consensus. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/CDC.2014.7039466 | Decision and Control |
Keywords | Field | DocType |
Markov processes,continuous time systems,discrete time systems,geometry,linear systems,matrix algebra,Sonin decomposition-separation theorem,backward propagating Markov chains,continuous time system,discrete time system,geometric approach,linear consensus algorithms,linear consensus system,state transition matrix | Convergence (routing),Consensus algorithm,Mathematical optimization,Computer science,Control theory,Markov chain,State-transition matrix,Discrete time and continuous time,Asymptotic analysis,Limiting | Conference |
ISSN | Citations | PageRank |
0743-1546 | 1 | 0.36 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sadegh Bolouki | 1 | 18 | 6.92 |
| Malhamé, R.P. | 2 | 1 | 0.36 |
| Milad Siami | 3 | 122 | 15.65 |
| Nader Motee | 4 | 181 | 28.18 |