Output Synchronization on Strongly Connected Graphs

In this technical note, we study output synchronization of networked multiagent systems. The agents, modeled as nonlinear systems with relative degree one, exchange information over a network described by an interagent communication graph. Inspired by the results of Igarashi , we extend our earlier results on output synchronization to include the case of strongly connected graphs. We first demonstrate output synchronization for input-output passive systems communicating over strongly connected graphs and include the practical case of constant time delays in communication. It is well known (Byrnes ) that weakly minimum phase systems with relative degree one are feedback equivalent to a passive system with a positive definite storage function. We exploit this feedback equivalence to develop control laws for output synchronization of such systems, exchanging outputs on strongly connected graphs, and in the presence of communication delays. A numerical example is also presented to illustrate the proposed results.