Asynchronous Distributed Consensus with Minimum Communication
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.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Secure Dynamic Event-triggered Consensus Under Asynchronous Denial of Service
This article proposes a secure implementation for consensus using a dynamic event-triggered (DET) communication scheme in high-order nonlinear multi-agent systems (MAS) under asynchronous (distributed) denial of service …
Asynchronous distributed collision avoidance with intention consensus for inland autonomous ships
This paper focuses on the problem of collaborative collision avoidance for autonomous inland ships. Two solutions are provided to solve the problem in a distributed manner. We first present a distributed model predictive…
Collision AvoidanceModel Predictive ControlConsensus Driven Learning
As the complexity of our neural network models grow, so too do the data and computation requirements for successful training. One proposed solution to this problem is training on a distributed network of computational de…
Distributed finite-time termination for consensus algorithm in switching topologies
In this article, we present a finite time stopping criterion for consensus algorithms in networks with dynamic communication topology. Recent results provide asymptotic convergence to the consensus algorithm. However, th…
Asynchronous Distributed ADMM for Large-Scale Optimization- Part I: Algorithm and Convergence Analysis
Aiming at solving large-scale learning problems, this paper studies distributed optimization methods based on the alternating direction method of multipliers (ADMM). By formulating the learning problem as a consensus pro…
Distributed Optimization