Digraphs with Distinguishable Dynamics Under the Multi‐Agent Agreement Protocol
DOI10.1002/asjc.868zbMath1306.05081arXiv1611.09987OpenAlexW3124355509MaRDI QIDQ5172912
Amir G. Aghdam, Mohammad Amin Rahimian, Amir Ajorlou
Publication date: 6 February 2015
Published in: Asian Journal of Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.09987
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Agent technology and artificial intelligence (68T42)
Related Items (1)
Cites Work
- Unnamed Item
- Leader localization in multi-agent systems subject to failure: a graph-theoretic approach
- Transfer function representation of cyclic consensus systems
- Distributed average consensus with least-mean-square deviation
- Structural controllability of multi-agent networks: robustness against simultaneous failures
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Network Failure Detection and Graph Connectivity
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A Necessary and Sufficient Condition for Consensus Over Random Networks
- Controllability of a Leader–Follower Dynamic Network With Switching Topology
- Convergence Speed in Distributed Consensus and Averaging
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
This page was built for publication: Digraphs with Distinguishable Dynamics Under the Multi‐Agent Agreement Protocol
