The projection method for continuous-time consensus seeking

DOI10.1134/S0005117915080081zbMath1384.93106arXiv1507.04177OpenAlexW3106043389MaRDI QIDQ276767

R. P. Agaev, Pavel Yu. Chebotarev

Publication date: 4 May 2016

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.04177

Mathematics Subject Classification ID

Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Linear systems in control theory (93C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Control/observation systems governed by ordinary differential equations (93C15) Agent technology and artificial intelligence (68T42)

Related Items (2)

Models of latent consensus ⋮ On the role of the eigenprojector of the Laplacian matrix for reaching consensus in multiagent second-order systems

Cites Work

• Unnamed Item
• Unnamed Item
• Coordination in multiagent systems and Laplacian spectra of digraphs
• On determining the eigenprojection and components of a matrix
• Forest matrices around the Laplacian matrix
• The matrix of maximum out forests of a digraph and its applications
• Distributed containment control with multiple stationary or dynamic leaders in fixed and switching directed networks
• The projection method for reaching consensus and the regularized power limit of a stochastic matrix
• The Forest Consensus Theorem
• A Characterization and Representation of the Drazin Inverse
• Reaching a Consensus
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays

This page was built for publication: The projection method for continuous-time consensus seeking