Constrained consensuses in disconnected topologies

This paper is concerned with the constrained consensuses problem for a group of agents in disconnected topologies. By dividing the communication topology into a combination of directed trees, some necessary and sufficient conditions are derived for all the agents to asymptotically reach a single consensus and multiple consensuses, respectively. The obtained results indicate that arbitrary anticipant consensuses can be achieved, if additional constrained controllers are added to those agents with specific indexes. Some illustrative examples are provided to demonstrate the effectiveness of the proposed theoretical results.