Coordination in multiagent systems and Laplacian spectra of digraphs
From MaRDI portal
Publication:1027720
DOI10.1134/S0005117909030126zbMATH Open1163.93305arXiv0902.4098OpenAlexW3102419163MaRDI QIDQ1027720FDOQ1027720
Publication date: 30 June 2009
Published in: Automation and Remote Control (Search for Journal in Brave)
Abstract: Constructing and studying distributed control systems requires the analysis of the Laplacian spectra and the forest structure of directed graphs. In this paper, we present some basic results of this analysis partially obtained by the present authors. We also discuss the application of these results to decentralized control and touch upon some problems of spectral graph theory.
Full work available at URL: https://arxiv.org/abs/0902.4098
Cites Work
- Fast linear iterations for distributed averaging
- Title not available (Why is that?)
- ON SMALL RANDOM PERTURBATIONS OF DYNAMICAL SYSTEMS
- Consensus and Cooperation in Networked Multi-Agent Systems
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Stability of multiagent systems with time-dependent communication links
- Laplacian matrices of graphs: A survey
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Reaching a Consensus
- 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
- Necessary and sufficient graphical conditions for formation control of unicycles
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
- On the spectra of nonsymmetric Laplacian matrices
- Decentralized control of vehicle formations
- Title not available (Why is that?)
- Asymptotic agreement in distributed estimation
- Title not available (Why is that?)
- Spanning forests of a digraph and their applications
- On Communication Requirements for Multi-agent Consensus Seeking
- Kernels of directed graph Laplacians
- Title not available (Why is that?)
- Flocks and formations
- Guaranteed robustness properties of multivariable nonlinear stochastic optimal regulators
Cited In (36)
- Synchronization of nonlinearly coupled networks based on circle criterion
- Micro- and macromodels of social networks. I: Theory fundamentals
- Adapting wing elements (``feathers) of an airplane in a turbulent flow with a multiagent protocol
- On the consensus protocol of conspecific agents
- Laplacian dynamics on general graphs
- Deviation bounds in multi-agent systems described by undirected graphs
- Complex adjacency spectra of digraphs
- The projection method for continuous-time consensus seeking
- On synchronization in heterogeneous FitzHugh-Nagumo networks
- Which digraphs with ring structure are essentially cyclic?
- Tsypkin and Jury-Lee criteria for synchronization and stability of discrete-time multiagent systems
- On the seminar on problems of nonlinear dynamics and control at Moscow State University
- On symmetric continuum opinion dynamics
- Adaptive synchronization in the complex heterogeneous networks of Hindmarsh-Rose neurons
- Multi-agent control: a graph-theoretic perspective
- On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
- Dynamic models of informational control in social networks
- Distributed containment control of multi-agent systems with velocity and acceleration saturations
- Consensus in asynchronous multiagent systems. I: Asynchronous consensus models
- The projection method for reaching consensus and the regularized power limit of a stochastic matrix
- On the boundary value of the time-delay and the asymptotic behavior of a continuous first-order consensus protocol
- Frequency-domain criteria for consensus in multiagent systems with nonlinear sector-shaped couplings
- Consensus in nonlinear stationary networks with identical agents
- On the role of the eigenprojector of the Laplacian matrix for reaching consensus in multiagent second-order systems
- Consensus of high-order multi-agent systems with switching topologies
- A new look at distributed optimal output agreement of multi-agent systems
- Control for a system of linear agents based on a high order adaptation algorithm
- New differentiated consensus problem with topology cost constraints
- State-dependent effective interactions in oscillator networks through coupling functions with dead zones
- Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties
- Distributed control of multi-agent systems with pulse-width-modulated controllers
- Models of strategic behavior
- Synchronization in networks of linear agents with output feedbacks
- The reflexive partitions method in models of collective behavior and control
- Equidistant arrangement of agents on line: analysis of the algorithm and its generalization
- A survey on distributed network localization from a graph Laplacian perspective
Uses Software
Recommendations
- Multi-agent control: a graph-theoretic perspective 👍 👎
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control 👍 👎
- Controllability of multi-agent systems under directed topology 👍 👎
- Decentralized estimation of Laplacian eigenvalues in multi-agent systems 👍 👎
- Stability analysis for multi-agent systems using the incidence matrix: quantized communication and formation control 👍 👎
This page was built for publication: Coordination in multiagent systems and Laplacian spectra of digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027720)
