Fast discrete consensus based on gossip for makespan minimization in networked systems
Publication:889003
DOI10.1016/j.automatica.2015.02.040zbMath1323.93006OpenAlexW2139215077MaRDI QIDQ889003
Mauro Franceschelli, Carla Seatzu, Alessandro Giua
Publication date: 5 November 2015
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11584/61136
multi-agent systemsnetworked systemsdistributed optimizationgossip algorithmsdiscrete consensusdistributed task assignmentquantized consensus
Decentralized systems (93A14) Control/observation systems governed by ordinary differential equations (93C15) Large-scale systems (93A15) Agent technology and artificial intelligence (68T42)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantized consensus in Hamiltonian graphs
- Dynamic load balancing by random matchings
- Gossip consensus algorithms via quantized communication
- The \(k\)-partitioning problem
- Optimal dimension-exchange token distribution on complete binary trees
- Gossip algorithms for heterogeneous multi-vehicle routing problems
- Quantized consensus
- Optimal two- and three-stage production schedules with setup times included
- Time Synchronization in WSNs: A Maximum-Value-Based Consensus Approach
- A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks
- Structural Information and Communication Complexity
- On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms
- Quantized Consensus and Averaging on Gossip Digraphs
- Quantized Consensus by Means of Gossip Algorithm
This page was built for publication: Fast discrete consensus based on gossip for makespan minimization in networked systems