Achieving Optimal Output Consensus for Discrete-time Linear Multi-agent Systems with Disturbances Rejection
In this paper, an optimal output consensus problem is studied for discrete-time linear multi-agent systems subject to external disturbances. Each agent is assigned with a local cost function which is known only to itself. Distributed protocols are to be designed to guarantee an output consensus for these high-order agents and meanwhile minimize the aggregate cost as the sum of these local costs. To overcome the difficulties brought by high-order dynamics and external disturbances, we develop an embedded design and constructively present a distributed rule to solve this problem. The proposed control includes three terms: an optimal signal generator under a directed information graph, an observer-based compensator to reject these disturbances, and a reference tracking controller for these linear agents. It is shown to solve the formulated problem with some mild assumptions. Numerical examples are also provided to illustrate the effectiveness of our proposed distributed control laws.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Distributed computation of fast consensus weights using ADMM
We consider the problem of achieving average consensus among multiple agents, where the inter-agent communication network is depicted by a graph. We consider the discrete-time consensus protocol where each agent updates …
Krasovskii Passivity for Sampled-data Stabilization and Output Consensus
In this paper, we establish the novel concept of Krasovskii passivity for sampled discrete-time nonlinear systems, enabling Krasovskii-passivity-based control design under sampling. We consider two separate control objec…
A Discrete-time Reputation-based Resilient Consensus Algorithm for Synchronous or Asynchronous Communications
We tackle the problem of a set of agents achieving resilient consensus in the presence of attacked agents. We present a discrete-time reputation-based consensus algorithm for synchronous and asynchronous networks by deve…
Minimal-time Deadbeat Consensus and Individual Disagreement Degree Prediction for High-order Linear Multi-agent Systems
In this paper, a Hankel matrix-based fully distributed algorithm is proposed to address a minimal-time deadbeat consensus prediction problem for discrete-time high-order multi-agent systems (MASs). Therein, each agent ca…
PredictionValue predictionDiscreteCommunication and ControlUpdating in Event-Triggered Consensus
This paper studies the consensus control problem faced with three essential demands, namely, discrete control updating for each agent, discrete-time communications among neighboring agents, and the fully distributed fash…