Models of latent consensus
DOI10.1134/S0005117917010076zbMath1365.93011arXiv1612.05201OpenAlexW2585602763MaRDI QIDQ2362339
R. P. Agaev, Pavel Yu. Chebotarev
Publication date: 7 July 2017
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.05201
regularizationdecentralized controlmulti-agent systemconsensusPageRankeigenprojectionDeGroot's iterative poolingLaplacian matrix of a digraph
Decentralized systems (93A14) Stochastic systems in control theory (general) (93E03) Control/observation systems governed by ordinary differential equations (93C15) Agent technology and artificial intelligence (68T42)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The projection method for continuous-time consensus seeking
- Distributed coordination of multi-agent networks. Emergent problems, models, and issues.
- Consensus of high-order linear systems using dynamic output feedback compensator: low gain approach
- Low gain feedback
- The matrix-forest theorem and measuring relations in small social groups
- Spanning forests of a digraph and their applications
- Forest matrices around the Laplacian matrix
- The matrix of maximum out forests of a digraph and its applications
- The projection method for reaching consensus and the regularized power limit of a stochastic matrix
- Regularization-based solution of the PageRank problem for large matrices
- The Forest Consensus Theorem
- The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
- Reaching a Consensus
- Semi-Global Leader-Following Consensus of Linear Multi-Agent Systems With Input Saturation via Low Gain Feedback
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
This page was built for publication: Models of latent consensus