Recently, to enable the application of fixed-time consensus algorithms in scenarios with time constraints, there has been an effort in finding the least upper bound of the settling time function of the class of fixed-time stable systems given in [1]}. First, in [2]} the least upper bound was found for a subclass of systems, which has lead to consensus protocols for dynamic networks such as [3]}, [4]}, [5]}, [6]}, [7]}. Recently, in [8]} the least upper bound for the settling time was found for the general class of fixed-time stable systems given in [1]}, based on this result in [10]} consensus protocols for dynamic networks, subsuming those given in [5]}, [6]}, were presented, where an upper bound of the convergence time can be set a priori as a parameter of the protocol, in view of this feature, this class of consensus algorithms is known as predefined-time consensus.
