Distributed constrained aggregative games of uncertain Euler-Lagrange systems under unbalanced digraphs

Abstract

Abstract In this paper, the constrained Nash equilibrium seeking problem of aggregative games is investigated for uncertain nonlinear Euler-Lagrange (EL) systems under unbalanced digraphs, where the cost function for each agent depends on its own decision variable and the aggregate of all other decisions. By embedding a distributed estimator of the left eigenvector associated with zero eigenvalue of the digraph Laplacian matrix, a dynamic adaptive average consensus protocol is employed to estimate the aggregate function in the unbalanced case. To solve the constrained Nash equilibrium seeking problem, an integrated distributed protocol based on output-constrained nonlinear control and projected dynamics is proposed for uncertain EL players to reach the Nash equilibrium. The convergence analysis is established by using variational inequality technique and Lyapunov stability analysis. Finally, a numerical example in electricity market is provided to validate the effectiveness of the proposed method.

Keywords

• Euler-Lagrange systems
• Aggregative games
• Unbalanced digraphs
• Output-constrained nonlinear control
• Constraints