Group consensus implies reaching multiple groups where agents belonging to the same cluster reach state consensus. This article focuses on linear multiagent systems under nonnegative directed graphs.

An approximate solution to the weighted-graph-matching problem is discussed for both undirected and directed graphs. The weighted-graph-matching problem is that of finding the optimum matching between ...