Controllability of the multi-agent system modeled by the threshold graph with one repeated degree

DOI10.1016/J.SYSCONLE.2016.09.010MaRDI QIDQ345017zbMATH OpenOpenAlexFDO

Authors Shun-Pin Hsu

Publication date 25 November 2016

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

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

zbMATH Keywords

controllabilitymulti-agent systemsthreshold graph

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42) Decentralized systems (93A14) Controllability (93B05)

Recommendations

• Minimal Laplacian controllability problems of threshold graphs
• Graph-theoretic characterization of controllability for multi-agent systems
• A necessary and sufficient condition for the controllability of single-leader multi-chain systems
• Controllability of multi-agent systems from a graph-theoretic perspective
• Controllability of Multi-Agent Dynamical Systems with a Broadcasting Control Signal

Cites work

• A Class of Uncontrollable Diffusively Coupled Multiagent Systems with Multichain Topologies
• A Decomposition Approach to Distributed Control of Spatially Invariant Systems
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Constrained distributed algebraic connectivity maximization in robotic networks
• Controllability and Observability of Grid Graphs via Reduction and Symmetries
• Controllability of multi-agent systems from a graph-theoretic perspective
• Coordination and Geometric Optimization via Distributed Dynamical Systems
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Degree maximal graphs are Laplacian integral
• Distributed control design for spatially interconnected systems
• Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
• Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
• Graph theory
• Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
• Minimal Controllability Problems
• Necessary and sufficient graphical conditions for formation control of unicycles
• On the Controllability Properties of Circulant Networks
• On the Reachability and Observability of Path and Cycle Graphs

Cited in

(6)

• Constructing a controllable graph under edge constraints
• Chain graphs with simple Laplacian eigenvalues and their Laplacian dynamics
• Controllability of multi-agent systems based on automorphism and leader symmetry
• Minimal Laplacian controllability problems of threshold graphs
• Laplacian controllable graphs based on connecting two antiregular graphs
• Generalising Laplacian controllability of paths

This page was built for publication: Controllability of the multi-agent system modeled by the threshold graph with one repeated degree

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