Leader localization in multi-agent systems subject to failure: a graph-theoretic approach
From MaRDI portal
Publication:642928
DOI10.1016/j.automatica.2011.02.051zbMath1226.93011OpenAlexW2070221063MaRDI QIDQ642928
Amir G. Aghdam, Saeid Jafari, Amir Ajorlou
Publication date: 27 October 2011
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://spectrum.library.concordia.ca/975175/1/Aghdam2011.pdf
Controllability (93B05) Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15)
Related Items (12)
An overview of structural systems theory ⋮ Leader selection for strong structural controllability of single-integrator multi-agent systems ⋮ Nodes selection strategy in cooperative tracking problem ⋮ Algorithm for identifying minimum driver nodes based on structural controllability ⋮ The single-input minimal controllability problem for structured systems ⋮ Controllability analysis of multi-agent systems with directed and weighted interconnection ⋮ Adaptive control and signal processing literature survey (No. 27) ⋮ Digraphs with Distinguishable Dynamics Under the Multi‐Agent Agreement Protocol ⋮ Controllability of discrete-time multi-agent systems with directed topology and input delay ⋮ Strong Structural Controllability and Leader Selection for Multi-agent Systems with Unidirectional Topology ⋮ Characterizing controllable subspace and herdability of signed weighted networks via graph partition ⋮ Group controllability of discrete-time time-delayed multiagent systems with multiple leaders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficient conditions for the convergence of a class of nonlinear distributed consensus algorithms
- Controllability of multi-agent systems based on agreement protocols
- Distributed learning and cooperative control for multi-agent systems
- Interconnection topologies for multi-agent coordination under leader-follower framework
- Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
- Rooted \(k\)-connections in digraphs
- Generic properties and control of linear structured systems: A survey
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- Controllability of a Leader–Follower Dynamic Network With Switching Topology
- Multi-Agent Coordination by Decentralized Estimation and Control
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- Necessary and sufficient graphical conditions for formation control of unicycles
- On State-dependent dynamic graphs and their controllability properties
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
- A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
This page was built for publication: Leader localization in multi-agent systems subject to failure: a graph-theoretic approach
