Quantized consensus in Hamiltonian graphs

DOI10.1016/J.AUTOMATICA.2011.08.032zbMATH Open1228.93009OpenAlexW2030888820MaRDI QIDQ646452FDOQ646452

Authors: Mauro Franceschelli, Alessandro Giua, C. 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

Recommendations

• Quantized consensus
• Average consensus on networks with quantized communication
• Quantized consensus of multi-agent systems via broadcast gossip algorithms
• Convergence time analysis of quantized gossip consensus on digraphs
• Gossip consensus algorithms via quantized communication

zbMATH Keywords

consensusquantizationdistributed averaginggossip

Mathematics Subject Classification ID

Decentralized systems (93A14) Control/observation systems governed by ordinary differential equations (93C15)

Cites Work

• Fast linear iterations for distributed averaging
• Quantized consensus
• 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
• Title not available (Why is that?)
• Meeting times of random walks on graphs
• On a random walk problem arising in self-stabilizing token management
• Communication constraints in the average consensus problem
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Gossip consensus algorithms via quantized communication
• Distributed Average Consensus With Dithered Quantization
• Nonlinear protocols for optimal distributed consensus in networks of dynamic agents
• An algorithm for finding Hamilton paths and cycles in random graphs
• On the existence of Hamiltonian cycles in a class of random graphs
• Self-stabilizing smoothing and balancing networks
• Optimal dimension-exchange token distribution on complete binary trees
• Dimension-exchange algorithms for token distribution on tree-connected architectures
• Strongly adaptive token distribution
• Efficient quantization in the average consensus problem
• Tight Analyses of Two Local Load Balancing Algorithms
• A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks
• Dynamic load balancing by random matchings

Cited In (10)

• An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs
• Quantized-output feedback model reference control of discrete-time linear systems
• Fast discrete consensus based on gossip for makespan minimization in networked systems
• Consensus in time-delayed multi-agent systems with quantized dwell times
• A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time
• Quantized consensus over directed networks with switching topologies
• HMM-based quantized dissipative control for 2-D Markov jump systems
• Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks
• Optimizing the convergence rate of the quantum consensus: a discrete-time model
• Consensus analysis for multi-agent systems via periodic event-triggered algorithms with quantized information

This page was built for publication: Quantized consensus in Hamiltonian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646452)