Distributed Coordination Algorithms with Efficient Communication for Open Multi-Agent Systems with Dynamic Communication Links and Processing Delays
This paper proposes and analyzes three communication-efficient distributed algorithms that achieve finite-time quantized average consensus in open multi-agent systems with dynamic directed links, arbitrary bounded processing delays, and continuous node turnover, while establishing novel topological conditions for convergence and demonstrating superior performance through simulations.