Optimal strategies in the average consensus problem
From MaRDI portal
Publication:847130
DOI10.1016/j.sysconle.2009.08.005zbMath1181.93009arXiv0708.3220OpenAlexW2571422703MaRDI QIDQ847130
Jean-Charles Delvenne, Ruggero Carli, Sandro Zampieri
Publication date: 12 February 2010
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0708.3220
Related Items
Consensus networks over finite fields ⋮ Graph diameter, eigenvalues, and minimum-time consensus ⋮ Average consensus on networks with quantized communication ⋮ Leader-following finite-time consensus for multi-agent systems with jointly-reachable leader ⋮ Finite-time consensus for heterogeneous multi-agent systems with mixed-order agents ⋮ Binary factorizations of the matrix of all ones ⋮ LQR-based optimal topology of leader-following consensus ⋮ Robust iterative learning protocols for finite-time consensus of multi-agent systems with interval uncertain topologies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Block Kronecker products and the vecb operator
- The lattice dimension of a graph
- D2B: A de Bruijn based content-addressable network
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Communication constraints in the average consensus problem
- Quantized consensus
- The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
- Consensus and Cooperation in Networked Multi-Agent Systems
- Fastest Mixing Markov Chain on a Graph
- On Distributed Averaging Algorithms and Quantization Effects
- Quantized average consensus via dynamic coding/decoding schemes
- Average Consensus with Packet Drop Communication
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Stability of multiagent systems with time-dependent communication links
