This paper presents a new class of protocols to solve finite-time consensus for multi-agent systems. The protocols are induced from the classical finite-time consensus algorithm by using the so-called protocol function. Sufficient conditions are established for networked agents to experience finite-time consensus under time-varying undirected and fixed directed topologies. Numerical simulations show that the proposed protocols can provide more flexibility to improve convergence rate.
This paper solves the robust fixed-time consensus problem for multi-agent systems with nonlinear state measurements. Sufficient conditions are established for the proposed protocol to reach fixed-time consensus under time-varying undirected and fixed directed topology with the aid of Lyapunov functions. It is proved that the finite settling time of the presented protocol for robust consensus is uniformly bounded for any initial condition, which makes it possible for people to design and estimate the convergence time off-line. Numerical simulations are preformed to show the effectiveness of our proposed protocol.