The projection method for continuous-time consensus seeking
From MaRDI portal
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Agent technology and artificial intelligence (68T42) Linear systems in control theory (93C05) Control/observation systems governed by ordinary differential equations (93C15) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05)
Abstract: 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 that consensus can be achieved by employing the method of orthogonal projection, which has been proposed for the discrete-time coordination problem.
Recommendations
- The projection method for reaching consensus and the regularized power limit of a stochastic matrix
- On the properties of orthogonal projection method for reaching consensus
- On the role of the eigenprojector of the Laplacian matrix for reaching consensus in multiagent second-order systems
- On the convergence domain in the differential model of reaching a consensus
- Sufficient conditions for the convergence of a class of nonlinear distributed consensus algorithms
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- A Characterization and Representation of the Drazin Inverse
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Coordination in multiagent systems and Laplacian spectra of digraphs
- Distributed containment control with multiple stationary or dynamic leaders in fixed and switching directed networks
- Forest matrices around the Laplacian matrix
- Graph theoretic methods in multiagent networks
- On determining the eigenprojection and components of a matrix
- Reaching a Consensus
- The Forest Consensus Theorem
- 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
Cited in
(5)- The projection method for reaching consensus and the regularized power limit of a stochastic matrix
- Models of latent consensus
- A lifting method for analyzing distributed synchronization on the unit sphere
- 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
This page was built for publication: The projection method for continuous-time consensus seeking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276767)
