Papers
Topics
Authors
Recent
2000 character limit reached

Asynchronous Distributed Consensus with Minimum Communication

Published 3 May 2023 in eess.SY and cs.SY | (2305.02448v1)

Abstract: In this paper, the communication effort required in a multi-agent system (MAS) is minimized via an explicit optimization formulation. The paper considers a MAS of single-integrator agents with bounded inputs and a time-invariant communication graph. A new model of discrete asynchronous communication and a distributed consensus protocol based on it, are proposed. The goal of the proposed protocol is to minimize the aggregate number of communication instants of all agents, required to steer the state trajectories inside a pres-specified bounded neighbourhood within a pre-specified time. Due to information structure imposed by the underlying communication graph, an individual agent does not know the global parameters in the MAS, which are required for the above-mentioned minimization. To counter this uncertainty, the worst-case realizations of the global parameters are considered, which lead to min-max type optimizations. The control rules in the proposed protocol are obtained as the closed form solutions of these optimization problems. Hence, the proposed protocol does not increase the burden of run-time computation making it suitable for time-critical applications.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.