Predefined‐time distributed event‐triggered algorithms for resource allocation

The resource allocation problem in a distributed multi‐agent system is considered in this study. First, the authors develop a predefined‐time distributed algorithm and analyse its convergence analysis using the Lyapunov stability theory, in which the local constraint is ensured by a differential projection operator. Thus, a predefined time is obtained by a time‐varying time‐based generator. Second, to reduce the communication consumption between agents, the authors develop a static as well as a dynamic‐based event‐triggered control scheme, where the information broadcast only occurs at some discrete time instants. Moreover, the three proposed algorithms converge precisely to the global optimal solution. Besides, the Zeno behaviour is excluded in the above static and dynamic event‐triggered mechanisms. Finally, the authors test the proposed algorithms' efficiency based on the provided numerical examples. This paper considers the distributed resource allocation problem over an undirected multi‐agent system by proposing a predefined‐time distributed algorithm. Furthermore, to reduce the communication burden, the static and dynamic event‐triggered mechanisms are provided.