Leader localization in multi-agent systems subject to failure: a graph-theoretic approach
From MaRDI portal
Publication:642928
DOI10.1016/J.AUTOMATICA.2011.02.051zbMATH Open1226.93011OpenAlexW2070221063MaRDI QIDQ642928FDOQ642928
Authors: Saeid Jafari, Amir Ajorlou, Amir G. Aghdam 
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
Recommendations
- Structural controllability of multi-agent networks: robustness against simultaneous failures
- Graph-theoretic characterization of controllability for multi-agent systems
- Controllability of multi-agent systems from a graph-theoretic perspective
- Controllability of multi-agent systems under directed topology
- Controllability of discrete-time multi-agent systems with multiple leaders on fixed networks
Controllability (93B05) Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Interconnection topologies for multi-agent coordination under leader-follower framework
- Controllability of multi-agent systems from a graph-theoretic perspective
- Generic properties and control of linear structured systems: A survey
- Necessary and sufficient graphical conditions for formation control of unicycles
- Controllability of a Leader–Follower Dynamic Network With Switching Topology
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
- Distributed learning and cooperative control for multi-agent systems
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Controllability of multi-agent systems based on agreement protocols
- Rooted \(k\)-connections in digraphs
- Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems
- Multi-Agent Coordination by Decentralized Estimation and Control
- Title not available (Why is that?)
- Sufficient conditions for the convergence of a class of nonlinear distributed consensus algorithms
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- On State-dependent dynamic graphs and their controllability properties
Cited In (14)
- Characterizing controllable subspace and herdability of signed weighted networks via graph partition
- Controllability analysis of multi-agent systems with directed and weighted interconnection
- Controllability of discrete-time multi-agent systems with directed topology and input delay
- Leader selection for strong structural controllability of single-integrator multi-agent systems
- A connectivity reduction strategy for multi-agent systems
- An overview of structural systems theory
- Digraphs with distinguishable dynamics under the multi-agent agreement protocol
- Algorithm for identifying minimum driver nodes based on structural controllability
- Group controllability of discrete-time time-delayed multiagent systems with multiple leaders
- Strong structural controllability and leader selection for multi-agent systems with unidirectional topology
- The single-input minimal controllability problem for structured systems
- Nodes selection strategy in cooperative tracking problem
- Adaptive control and signal processing literature survey (No. 27)
- A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control
This page was built for publication: Leader localization in multi-agent systems subject to failure: a graph-theoretic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642928)
