| Summary: | In this paper, the practical prescribed-time bipartite consensus problem of linear multi-agent systems with a connected structurally balanced signed graph is investigated by using event-triggered mechanism. Novel event-triggered control law and triggering condition are proposed for each agent, in which the sampled states of agent and its neighbors are needed. By using the algebraic graph theory and Lyapunov stability theory, it is verified that the practical bipartite consensus can be achieved at fully prespecified time with an adjustable neighborhood range. Moreover, a theoretical discussion is provided to illustrate that Zeno behavior can be avoided during the whole time span. The feasibility of the presented control strategy is validated by a simulation result.
|
|---|