The Cooperative Optimization Of Multi-agent Systems

In this paper,we mainly discuss the cooperative optimization of multi-agent system-s.In the second part,based on event-triggered conditions,the constrained optimization and the consensus problem of multi-agent systems are discussed under time-varying di-rected graph topology.In the third part,based on the new random sleep algorithm,the unconstrained optimization and the consensus problem of multi-agent systems are discussed under stochastically uniformly strongly connected topology.Firstly,several fundamental lemmas are given.Secondly,the conditions for the multi-agent systems to achieve the optimal consensus are discussed respectively.Finally,two examples are given to illustrate the effectiveness of theoretical knowledge.