Graph Controllability Classes for the Laplacian Leader-Follower Dynamics

DOI10.1109/TAC.2014.2381435MaRDI QIDQ2982707zbMATH OpenFDO

Authors Cesar O. Aguilar, Bahman Gharesifard

Publication date 16 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2014.2381435

Mathematics Subject Classification ID

Controllability (93B05) Eigenvalue problems (93B60) Linear systems in control theory (93C05)

Cited in

(36)

• Controllability of multi-agent systems with directed and weighted signed networks
• Constructing a controllable graph under edge constraints
• Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms
• Structural controllability of networked relative coupling systems
• Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
• Partial strong structural controllability
• Net Laplacian controllability for joins of signed graphs
• Laplacian controllability for graphs obtained by some standard products
• Laplacian controllability classes for threshold graphs
• Rethinking structural balance in signed social networks
• Block-based minimum input design for the structural controllability of complex networks
• Characterizing controllable subspace and herdability of signed weighted networks via graph partition
• Almost equitable partitions and new necessary conditions for network controllability
• The robust minimal controllability problem
• Leader-follower containment control over directed random graphs
• On the selection of leaders for the controllability of multi-agent networks
• On a Conjecture of Godsil Concerning Controllable Random Graphs
• Controllability of the multi-agent system modeled by the threshold graph with one repeated degree
• Laplacian Dynamics on Cographs: Controllability Analysis Through Joins and Unions
• Controllability of NEPSes of graphs
• Stabilization of bilinear sparse matrix control systems using periodic inputs
• Unified understanding and new results of controllability model of multi‐agent systems
• SUSTAINABILITY NARROWNESS
• Communicability cosine distance: similarity and symmetry in graphs/networks
• Controllability of networked multiagent systems based on linearized Turing's model
• Design of controllable leader-follower networks via memetic algorithms
• On topological conditions for enabling transient control in leader-follower networks
• Herdability of Nash equilibrium in neighbour-based game control system
• Laplacian controllable graphs based on connecting two antiregular graphs
• Controllability of Indu-Bala product networks
• The controllability and structural controllability of Laplacian dynamics
• Controllability analysis for impulsive multi-agent systems with switching effects
• Generalising Laplacian controllability of paths
• Controllability and observability of networked singular systems
• Group controllability of continuous-time multi-agent systems
• Selective convergence of followers to multiple leaders with repulsion and cohesion on Riemannian manifolds

This page was built for publication: Graph Controllability Classes for the Laplacian Leader-Follower Dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2982707)