Consensus of Linear CNSs with Directed Switching Topologies
Guanghui Wen, Wenwu Yu, Yuezu Lv, Peijun Wang · 2021
This chapter studies the consensus problems for complex network systems with linear dynamics and directed switching topologies. Section 3.1 studies the leaderless consensus problems. This section begins by introducing some previous works and by presenting our motivation. Then the linear complex network systems model and the main theoretical results are presented. A simulation is also given to validate the obtained result. Compared to previous works, a main improvement of this section is that the switching topologies are allowed to have spanning trees rooted at different nodes. Section 3.2 studies the leader-following consensus problem for the case with an autonomous leader and the case with a nonautonomous leader. This section presents an iterative optimization algorithm to construct a class of novel multiple Lyapunov functions such that a smaller (average) dwell time is required compared with that constructed by the traditional nonsingular M -matrix theory.