Distributed Nash equilibrium seeking for multi-cluster aggregative games with applications to location control.

This paper considers a class of distributed aggregative games for first-order and second-order integrator-type multi-cluster systems, respectively. Two Nash equilibrium seeking algorithms are designed based on a distributed aggregation observer which is used to estimate the aggregations of the clusters. The convergence is proved by the input-to-state stable method. Moreover, the algorithms are applied to a class of location control problems, that is, distributed nonlinear placement problems for multi-cluster systems. Finally, some simulations are presented to illustrate the effectiveness of the designed algorithms. [ABSTRACT FROM AUTHOR]