185 citations · 562 across the 14 of their papers we have counts for
15 papers
Two Models of Latent Consensus in Multi-Agent Systems
Rafig Agaev, Pavel Chebotarev
In this paper, we propose several consensus protocols of the first and second order for networked multi-agent systems and provide explicit representations for their asymptotic stat…
Models of latent consensus
Rafig Agaev, Pavel Chebotarev
The paper studies the problem of achieving consensus in multi-agent systems in the case where the dependency digraph has no spanning in-tree. We consider the regularization pro…
The projection method for continuous-time consensus seeking
Rafig Agaev, Pavel Chebotarev
For the case where the dependency digraph has no spanning in-tree, we characterize the region of convergence of the basic continuous-time distributed consensus algorithm and show t…
The forest consensus theorem
Pavel Chebotarev, Rafig Agaev
We show that the limiting state vector in the differential model of consensus seeking with an arbitrary communication digraph is obtained by multiplying the eigenprojection of the…
A Cyclic Representation of Discrete Coordination Procedures
Rafig Agaev, Pavel Chebotarev
We show that any discrete opinion pooling procedure with positive weights can be asymptotically approximated by DeGroot's procedure whose communication digraph is a Hamiltonian cyc…
The Projection Method for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix
R. P. Agaev, P. Yu. Chebotarev
In the coordination/consensus problem for multi-agent systems, a well-known condition of achieving consensus is the presence of a spanning arborescence in the communication digraph…