Graph-balancing algorithms for average consensus over directed networks
From MaRDI portal
Publication:2795120
DOI10.1080/00207721.2015.1029720zbMath1333.93006OpenAlexW2035506445MaRDI QIDQ2795120
Yuan Fan, Jianbin Qiu, Runzhe Han
Publication date: 18 March 2016
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2015.1029720
Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15) Agent technology and artificial intelligence (68T42)
Related Items (1)
Cites Work
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- The leader-following attitude control of multiple rigid spacecraft systems
- Virtual neighbor based connectivity preserving of multi-agent systems with bounded control inputs in the presence of unreliable communication links
- Distributed event-triggered control of multi-agent systems with combinational measurements
- Continuous-time and sampled-data-based average consensus with logarithmic quantizers
- Fast linear iterations for distributed averaging
- On the notion of balance of a signed graph
- Finite-time consensus for leader-following second-order multi-agent system
- Self-Triggered Consensus for Multi-Agent Systems With Zeno-Free Triggers
- Stabilization of Networked Control Systems via Dynamic Output-Feedback Controllers
- Distributed Sensor Localization in Random Environments Using Minimal Number of Anchor Nodes
- Consensus and Cooperation in Networked Multi-Agent Systems
- On average consensus in directed networks of agents with switching topology and time delay
- Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
- 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
- Stable Flocking of Multiple Inertial Agents on Balanced Graphs
- Cooperative Output Regulation of Linear Multi-Agent Systems
- Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs
- On a Class of Directed Graphs—With an Application to Traffic-Flow Problems
This page was built for publication: Graph-balancing algorithms for average consensus over directed networks