Fast discrete consensus based on gossip for makespan minimization in networked systems

DOI10.1016/J.AUTOMATICA.2015.02.040MaRDI QIDQ889003zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

multi-agent systemsnetworked systemsdistributed optimizationdiscrete consensusdistributed task assignmentgossip algorithmsquantized consensus

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42) Decentralized systems (93A14) Large-scale systems (93A15) Control/observation systems governed by ordinary differential equations (93C15)

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

Cites work

• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 6922318 (Why is no real title available?)
• A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks
• Dynamic load balancing by random matchings
• Gossip algorithms for heterogeneous multi-vehicle routing problems
• Gossip consensus algorithms via quantized communication
• On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms
• Optimal dimension-exchange token distribution on complete binary trees
• Optimal two- and three-stage production schedules with set-up time included
• Quantized Consensus and Averaging on Gossip Digraphs
• Quantized Consensus by Means of Gossip Algorithm
• Quantized consensus
• Quantized consensus in Hamiltonian graphs
• Structural Information and Communication Complexity
• The \(k\)-partitioning problem
• Time Synchronization in WSNs: A Maximum-Value-Based Consensus Approach

Cited in

(5)

• Optimal design for manipulation of random consensus over discrete information in networked systems
• Stabilization of discrete-time semi-Markov jump singularly perturbed systems subject to actuator saturation and partially known semi-Markov kernel information
• A novel fully distributed discrete-time min-max consensus seeking algorithm with high convergence speed
• 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)