Guiding a group of networked linear systems through constrained communications

The guiding problem of networked linear systems through saturated couplings is considered. A leader acts as a guider, guiding N followers. Information is exchanged between the leader and the followers through a network; that is, the states of the leader and the follower are coupled according to the network. Saturated coupling strategy is presented among the leader and the followers such that all the followers can be guided by the leader, for both fixed and switching network topologies. Simulation indicates the capabilities of the algorithms.