On the controlled consensus protocols with directed graphs

The paper studies the controllability problem for consensus protocols with leader-following structure and directed information topologies. Some algebraic criteria for controllability are presented based on the eigenvalues of the underlying system information topology laplacian. In addition, the reflections of the system information topology on system controllability are investigated from graph theory.