Graph Interpretation of the Method of Orthogonal Projection for Regularization in Multiagent Systems
Authors:
- 27 September 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Abstract
This report is devoted to the problem of regularization in agreement of characteristics and consensus in multiagent systems. Based on the theory of generalized matrix inverses and algebraic graph theory, it is proved that the method of orthogonal projection is a natural generalization of the consensus method for a disconnected communication digraph. The graph interpretation of the method of orthogonal projection is given.Keywords
This publication has 9 references indexed in Scilit:
- Models of latent consensusAutomation and Remote Control, 2017
- The projection method for reaching consensus and the regularized power limit of a stochastic matrixAutomation and Remote Control, 2011
- Coordination in multiagent systems and Laplacian spectra of digraphsAutomation and Remote Control, 2009
- Clustering by weighted cuts in directed graphs2007
- Learning from labeled and unlabeled data on a directed graph2005
- Coordination Variables and Consensus Building in Multiple Vehicle Systems2004
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Coordination of groups of mobile autonomous agents using nearest neighbor rulesIEEE Transactions on Automatic Control, 2003
- Spanning Forests of a Digraph and Their ApplicationsAutomation and Remote Control, 2001