Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks
From MaRDI portal
Publication:1680837
DOI10.1016/j.nahs.2017.06.008zbMath1422.68011MaRDI QIDQ1680837
Mauro Franceschelli, Carla Seatzu, Alessandro Giua
Publication date: 16 November 2017
Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11584/234097
multi-agent systems; distributed optimization; gossip algorithms; distributed task assignment; quantized consensus
68R10: Graph theory (including graph drawing) in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M14: Distributed systems
68W20: Randomized algorithms
68W15: Distributed algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Quantized consensus in Hamiltonian graphs
- Fast discrete consensus based on gossip for makespan minimization in networked systems
- Spatio-temporal multi-robot routing
- Gossip consensus algorithms via quantized communication
- The \(k\)-partitioning problem
- 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
- On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms
- Quantized Consensus and Averaging on Gossip Digraphs
- Quantized Consensus by Means of Gossip Algorithm
- Ergodic Randomized Algorithms and Dynamics Over Networks