Constructing a controllable graph under edge constraints

DOI10.1016/j.sysconle.2017.07.015zbMath1376.93022OpenAlexW2752891763MaRDI QIDQ1680674

Shun-Pin Hsu

Publication date: 16 November 2017

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2017.07.015

zbMATH Keywords

controllabilitypath graphmulti-agent systemsthreshold graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Controllability (93B05) Applications of graph theory to circuits and networks (94C15) Agent technology and artificial intelligence (68T42)

Related Items (1)

The controllability of graphs with diameter \(0-2\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Controllability of the multi-agent system modeled by the threshold graph with one repeated degree
• Zero forcing number, constrained matchings and strong structural controllability
• Zero forcing parameters and minimum rank problems
• Interconnection topologies for multi-agent coordination under leader-follower framework
• Degree maximal graphs are Laplacian integral
• Laplacian controllability classes for threshold graphs
• Multi-Agent Machine Learning
• A necessary and sufficient condition for the controllability of single-leader multi-chain systems
• Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
• Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
• Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
• Controllability of a Leader–Follower Dynamic Network With Switching Topology
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
• Necessary and sufficient graphical conditions for formation control of unicycles
• Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
• On the Reachability and Observability of Path and Cycle Graphs
• A Class of Uncontrollable Diffusively Coupled Multiagent Systems with Multichain Topologies
• Controllability and Observability of Grid Graphs via Reduction and Symmetries
• Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
• On the Controllability Properties of Circulant Networks
• Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
• Antiregular graphs are universal for trees

This page was built for publication: Constructing a controllable graph under edge constraints