Effect of Adding Edges to Consensus Networks With Directed Acyclic Graphs

DOI10.1109/TAC.2017.2692527zbMath1390.90193WikidataQ57446956 ScholiaQ57446956MaRDI QIDQ4566826

Hai-Tao Zhang, Xiaoyu Mo, Zhi-yong Chen

Publication date: 27 June 2018

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Decentralized systems (93A14) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

Adaptive distributed observer for an uncertain leader over acyclic switching digraphs ⋮ The effect of reverse edges on convergence rate of directed weighted chain network ⋮ Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems ⋮ Investigating the effect of edge modifications on networked control systems: stability analysis ⋮ Topology design for group consensus in directed multi-agent systems ⋮ Complex group consensus of multi-agent systems with cooperative-competitive mechanisms: acyclic partition method ⋮ CONVERGENCE RATE AND GLOBAL MEAN WEIGHTED FIRST-PASSAGE TIME IN A 1D CHAIN NETWORK WITH A WEIGHTED ADDING REVERSE EDGE ⋮ Effects of adding a reverse edge across a stem in a directed acyclic graph ⋮ Merging relative sensing networks: a stability margin perspective ⋮ Average Consensus for Multi‐Agent System with Measurement Noise and Binary‐Valued Communication

This page was built for publication: Effect of Adding Edges to Consensus Networks With Directed Acyclic Graphs