From undirected graphs to directed graphs:a new technique makes it possible for multi-agent systems

This communique introduces a simple technique,which enables the Laplacian-like matrix of a directed graph to be diagonalisable.Thus many results on multi-agent systems over undirected graphs can be extended to directed graphs.As an example,we show how to make this extension of a popular Automatica paper.