Fast discrete consensus based on gossip for makespan minimization in networked systems
From MaRDI portal
Publication:889003
DOI10.1016/j.automatica.2015.02.040zbMath1323.93006MaRDI 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 systems; networked systems; distributed optimization; gossip algorithms; discrete consensus; distributed task assignment; quantized consensus
93A14: Decentralized systems
93C15: Control/observation systems governed by ordinary differential equations
93A15: Large-scale systems
68T42: Agent technology and artificial intelligence
Related Items
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, Stabilization of discrete-time semi-Markov jump singularly perturbed systems subject to actuator saturation and partially known semi-Markov kernel information
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