This paper mainly investigates the bipartite fixed-time consensus problem with or without disturbances of multi-agent systems. Firstly, we propose a novel bipartite fixed-time consensus algorithm based on event-triggered mechanism. Secondly, we use Lyapunov stability theory to guarantee that all agents states can reach a consensus of bipartite fixed-time. Then, the fixed-time stability theory is used to estimate the settling time, which shows that the settling time has nothing to do with the initial state of all agents. Furthermore, it is proved that under this consensus protocol, no zeno behavior is occurred. Finally, two numerical examples are finally presented to illustrate the theoretical analysis correctness.
This paper mainly investigates the bipartite fixed-time consensus problem with or without disturbances of multi-agent systems. Firstly, we propose a novel bipartite fixed-time consensus algorithm based on event-triggered mechanism. Secondly, we use Lyapunov stability theory to guarantee that all agents states can reach a consensus of bipartite fixed-time. Then, the fixed-time stability theory is used to estimate the settling time, which shows that the settling time has nothing to do with the initial state of all agents. Furthermore, it is proved that under this consensus protocol, no zeno behavior is occurred. Finally, two numerical examples are finally presented to illustrate the theoretical analysis correctness.