Fast discrete consensus based on gossip for makespan minimization in networked systems
DOI10.1016/J.AUTOMATICA.2015.02.040zbMATH Open1323.93006OpenAlexW2139215077MaRDI QIDQ889003FDOQ889003
Authors: Mauro Franceschelli, Alessandro Giua, C. Seatzu 
Publication date: 5 November 2015
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11584/61136
Recommendations
- Quantized consensus
- Convergence of max-min consensus algorithms
- Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks
- Distributed average consensus via gossip algorithm with real-valued and quantized data for \(0<q<1\)
- Convergence speed in distributed consensus and averaging
multi-agent systemsnetworked systemsdistributed optimizationdiscrete consensusdistributed task assignmentgossip algorithmsquantized consensus
Agent technology and artificial intelligence (68T42) Decentralized systems (93A14) Large-scale systems (93A15) Control/observation systems governed by ordinary differential equations (93C15)
Cites Work
- Title not available (Why is that?)
- Quantized consensus
- Optimal two- and three-stage production schedules with set-up time included
- Title not available (Why is that?)
- Gossip algorithms for heterogeneous multi-vehicle routing problems
- The \(k\)-partitioning problem
- Time Synchronization in WSNs: A Maximum-Value-Based Consensus Approach
- Gossip consensus algorithms via quantized communication
- Quantized Consensus and Averaging on Gossip Digraphs
- Optimal dimension-exchange token distribution on complete binary trees
- A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks
- Quantized consensus in Hamiltonian graphs
- Dynamic load balancing by random matchings
- Quantized Consensus by Means of Gossip Algorithm
- Title not available (Why is that?)
- Structural Information and Communication Complexity
- On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms
Cited In (3)
- Stabilization of discrete-time semi-Markov jump singularly perturbed systems subject to actuator saturation and partially known semi-Markov kernel information
- 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
This page was built for publication: Fast discrete consensus based on gossip for makespan minimization in networked systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889003)
