Distributed Optimal Cooperation for Multiple High-Order Nonlinear Systems With Lipschitz-Type Gradients: Static and Adaptive State-Dependent Designs.

This article investigates the distributed optimal cooperation problems for multiple high-order systems, in which the dynamics of each agent is allowed to be subject to unknown nonlinearities. To eliminate the effect caused by unknown nonlinearities, a nonlinearity estimator is developed based on agents’ states, which successfully reconstructs the nonlinear dynamics if the unknown nonlinearities are bounded. And to minimize the sum of multiple local nonlinear cost functions with Lipschitz-type gradients, a couple of static and adaptive state-dependent algorithms are designed, respectively, where each agent may only have access to its own local cost function. It is challenging to solve such an optimal cooperation problem as the performance of the whole multiagent network is evaluated by the sum of all local performance functions. In order to fulfill the goal of cooperative optimization, a state-dependent distributed optimal cooperation algorithm is proposed first. By utilizing tools from the Lyapunov stability theory and convex optimization analysis, it is proven that the considered distributed optimal cooperation problem for high-order nonlinear systems can be solved by the proposed optimal cooperation algorithm if the state-dependent parameters are suitably selected. It is noted that the selections of the state-dependent parameters depend on some global information of the multiagent systems. Furthermore, by incorporating the proposed optimal cooperation algorithm with adaptive parameters strategy, the optimal cooperation problem is solved in a fully distributed manner. Finally, a numerical simulation is shown to verify the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]