Models of latent consensus

DOI10.1134/S0005117917010076MaRDI QIDQ2362339zbMATH OpenOpenAlexFDO

Authors R. P. Agaev, Pavel 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

zbMATH Keywords

regularizationconsensusdecentralized controlmulti-agent systemPageRankeigenprojectionDeGroot's iterative poolingLaplacian matrix of a digraph

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42) Decentralized systems (93A14) Control/observation systems governed by ordinary differential equations (93C15) Stochastic systems in control theory (general) (93E03)

Abstract: The paper studies the problem of achieving consensus in multi-agent systems in the case where the dependency digraph $Gamma$ has no spanning in-tree. We consider the regularization protocol that amounts to the addition of a dummy agent (hub) uniformly connected to the agents. The presence of such a hub guarantees the achievement of an asymptotic consensus. For the "evaporation" of the dummy agent, the strength of its influences on the other agents vanishes, which leads to the concept of latent consensus. We obtain a closed-form expression for the consensus when the connections of the hub are symmetric, in this case, the impact of the hub upon the consensus remains fixed. On the other hand, if the hub is essentially influenced by the agents, whereas its influence on them tends to zero, then the consensus is expressed by the scalar product of the vector of column means of the Laplacian eigenprojection of $Gamma$ and the initial state vector of the system. Another protocol, which assumes the presence of vanishingly weak uniform background links between the agents, leads to the same latent consensus.

Recommendations

• Protocols forcing consensus
• Reaching a consensus: a discrete nonlinear time-varying case
• On the properties of orthogonal projection method for reaching consensus
• Reaching a consensus with limited information
• On the role of the eigenprojector of the Laplacian matrix for reaching consensus in multiagent second-order systems

Cites work

• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3587957 (Why is no real title available?)
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Consensus of high-order linear systems using dynamic output feedback compensator: low gain approach
• Distributed coordination of multi-agent networks. Emergent problems, models, and issues.
• Forest matrices around the Laplacian matrix
• Google's PageRank and beyond. The science of search engine rankings
• Graph theoretic methods in multiagent networks
• Low gain feedback
• Reaching a Consensus
• Regularization-based solution of the PageRank problem for large matrices
• Semi-Global Leader-Following Consensus of Linear Multi-Agent Systems With Input Saturation via Low Gain Feedback
• Spanning forests of a digraph and their applications
• The Forest Consensus Theorem
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
• The matrix of maximum out forests of a digraph and its applications
• The matrix-forest theorem and measuring relations in small social groups
• The projection method for continuous-time consensus seeking
• The projection method for reaching consensus and the regularized power limit of a stochastic matrix

Cited in

(6)

• Multi-valued cognitive maps: calculations with linguistic variables without using numbers
• The projection method for reaching consensus and the regularized power limit of a stochastic matrix
• A unifying model to measure consensus solutions in a society
• On the role of the eigenprojector of the Laplacian matrix for reaching consensus in multiagent second-order systems
• On the properties of orthogonal projection method for reaching consensus
• De Finettian consensus

This page was built for publication: Models of latent consensus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2362339)