Parallel Feedforward Compensation for Output Synchronization: Fully Distributed Control and Indefinite Laplacian

10/25/2021
by   Mengmou Li, et al.
0

This work is associated with the use of parallel feedforward compensators (PFCs) for the problem of output synchronization over heterogeneous agents and the benefits this approach can provide. Specifically, it addresses the addition of stable PFCs on agents that interact with each other using diffusive couplings. The value in the application of such PFC is twofold. Firstly, it has been an issue that output synchronization among passivity-short systems requires global information for the design of controllers in the cases when initial conditions need to be taken into account, such as average consensus and distributed optimization. We show that a stable PFC can be designed to passivate a passivity-short system while its output asymptotically vanishes as its input tends to zero. As a result, output synchronization is achieved among these systems by fully distributed controls without altering the original consensus results. Secondly, in the literature of output synchronization over signed weighted graphs, it is generally required that the graph Laplacian be positive semidefinite, i.e., L ≥ 0 for undirected graphs or L + L^T ≥ 0 for balanced directed graphs. We show that the PFC serves as output feedback to the communication graph to enhance the robustness against negative weight edges. As a result, output synchronization is achieved over a signed weighted and balanced graph, even if the corresponding Laplacian is not positive semidefinite.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2019

Input-Feedforward-Passivity-Based Distributed Optimization Over Jointly Connected Balanced Digraphs

In this paper, a distributed optimization problem is investigated via in...
research
10/26/2022

DiscreteCommunication and ControlUpdating in Event-Triggered Consensus

This paper studies the consensus control problem faced with three essent...
research
04/07/2019

Global Synchronization of Clocks in Directed Rooted Acyclic Graphs: A Hybrid Systems Approach

In this paper, we study the problem of robust global synchronization of ...
research
01/25/2017

Distributed methods for synchronization of orthogonal matrices over graphs

This paper addresses the problem of synchronizing orthogonal matrices ov...
research
09/06/2020

New Results on Delay Robustness of Consensus Algorithms

Consensus of autonomous agents is a benchmark problem in cooperative con...
research
05/05/2020

On recovery guarantees for angular synchronization

The angular synchronization problem of estimating a set of unknown angle...
research
11/09/2021

Resistance Distance and Control Performance for Google bittide Synchronization

We discuss control of bittide distributed systems, which are designed to...

Please sign up or login with your details

Forgot password? Click here to reset