Abstract
AbstractIn this work, the consensus problem of multi‐agent systems is addressed whose agent dynamics are described by the switched linear system, and the interaction topology is a directed graph. Two cases are considered: For completely controllable agent dynamics, a novel construct method of control law and switching signal are proposed to derive sufficient conditions to solve the finite‐time consensus problem. When the controllability of the agent system is incomplete, it is proven that the uncontrollable sub‐mode of agent dynamics is consistently asymptotically stabilizable is a key condition to achieve consistency for multi‐agent systems. Finally, numerical examples are provided to demonstrate the effectiveness of the theoretical results obtained in this paper.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
