Quantized consensus in Hamiltonian graphs
From MaRDI portal
Publication:646452
DOI10.1016/j.automatica.2011.08.032zbMath1228.93009MaRDI QIDQ646452
Alessandro Giua, Mauro Franceschelli, Carla Seatzu
Publication date: 17 November 2011
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2011.08.032
93A14: Decentralized systems
93C15: Control/observation systems governed by ordinary differential equations
Related Items
A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time, Fast discrete consensus based on gossip for makespan minimization in networked systems, Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks, HMM-based quantized dissipative control for 2-D Markov jump systems, Quantized-output feedback model reference control of discrete-time linear systems, Consensus in time-delayed multi-agent systems with quantized dwell times, Consensus analysis for multi-agent systems via periodic event-triggered algorithms with quantized information, Quantized consensus over directed networks with switching topologies
Cites Work
- Unnamed Item
- Unnamed Item
- Meeting times of random walks on graphs
- Dynamic load balancing by random matchings
- Nonlinear protocols for optimal distributed consensus in networks of dynamic agents
- Gossip consensus algorithms via quantized communication
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- An algorithm for finding Hamilton paths and cycles in random graphs
- Optimal dimension-exchange token distribution on complete binary trees
- On the existence of Hamiltonian cycles in a class of random graphs
- Dimension-exchange algorithms for token distribution on tree-connected architectures
- Strongly adaptive token distribution
- Self-stabilizing smoothing and balancing networks
- Communication constraints in the average consensus problem
- Fast linear iterations for distributed averaging
- Quantized consensus
- Tight Analyses of Two Local Load Balancing Algorithms
- Distributed Average Consensus With Dithered Quantization
- A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks
- On a random walk problem arising in self-stabilizing token management
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
- Embedding of cycles in arrangement graphs
