Coordination in multiagent systems and Laplacian spectra of digraphs
From MaRDI portal
(Redirected from Publication:1027720)
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.
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
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3587957 (Why is no real title available?)
- scientific article; zbMATH DE number 3095571 (Why is no real title available?)
- Asymptotic agreement in distributed estimation
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus and Cooperation in Networked Multi-Agent Systems
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Decentralized control of vehicle formations
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Fast linear iterations for distributed averaging
- Flocks and formations
- Forest matrices around the Laplacian matrix
- Guaranteed robustness properties of multivariable nonlinear stochastic optimal regulators
- Kernels of directed graph Laplacians
- Laplacian matrices of graphs: A survey
- Necessary and sufficient graphical conditions for formation control of unicycles
- ON SMALL RANDOM PERTURBATIONS OF DYNAMICAL SYSTEMS
- On Communication Requirements for Multi-agent Consensus Seeking
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
- On determining the eigenprojection and components of a matrix
- On the spectra of nonsymmetric Laplacian matrices
- Reaching a Consensus
- Spanning forests of a digraph and their applications
- Stability of multiagent systems with time-dependent communication links
- Synchronization in complex networks of nonlinear dynamical systems
- The matrix of maximum out forests of a digraph and its applications
Cited in
(40)- Micro- and macromodels of social networks. I: Theory fundamentals
- Multi-agent control: a graph-theoretic perspective
- The projection method for reaching consensus and the regularized power limit of a stochastic matrix
- On symmetric continuum opinion dynamics
- The projection method for continuous-time consensus seeking
- Synchronization of nonlinearly coupled networks based on circle criterion
- On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
- Which digraphs with ring structure are essentially cyclic?
- New differentiated consensus problem with topology cost constraints
- Complex adjacency spectra of digraphs
- A note on the diagonally stable matrix induced from graph Laplacian
- On synchronization in heterogeneous FitzHugh-Nagumo networks
- Tsypkin and Jury-Lee criteria for synchronization and stability of discrete-time multiagent systems
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
- Equidistant arrangement of agents on line: analysis of the algorithm and its generalization
- Models of strategic behavior
- Consensus in asynchronous multiagent systems. I: Asynchronous consensus models
- Dynamic models of informational control in social networks
- Adapting wing elements (``feathers) of an airplane in a turbulent flow with a multiagent protocol
- On the consensus protocol of conspecific agents
- On the seminar on problems of nonlinear dynamics and control at Moscow State University
- State-dependent effective interactions in oscillator networks through coupling functions with dead zones
- The reflexive partitions method in models of collective behavior and control
- On the role of the eigenprojector of the Laplacian matrix for reaching consensus in multiagent second-order systems
- On the boundary value of the time-delay and the asymptotic behavior of a continuous first-order consensus protocol
- Distributed containment control of multi-agent systems with velocity and acceleration saturations
- 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
- Laplacian dynamics on general graphs
- Frequency-domain criteria for consensus in multiagent systems with nonlinear sector-shaped couplings
- Stability analysis for multi-agent systems using the incidence matrix: quantized communication and formation control
- Deviation bounds in multi-agent systems described by undirected graphs
- A survey on distributed network localization from a graph Laplacian perspective
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
- Adaptive synchronization in the complex heterogeneous networks of Hindmarsh-Rose neurons
- Synchronization in networks of linear agents with output feedbacks
- Consensus in nonlinear stationary networks with identical agents
- Control a state-dependent dynamic graph to a pre-specified structure
- Consensus of high-order multi-agent systems with switching topologies
- Distributed control of multi-agent systems with pulse-width-modulated controllers
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)
