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

Yanqiong Zhang , Chaoqun Liu , Yu-Ping Tian

Autonomous Intelligent Systems ›› 2022, Vol. 2 ›› Issue (1) : 9

PDF
Autonomous Intelligent Systems ›› 2022, Vol. 2 ›› Issue (1) : 9 DOI: 10.1007/s43684-022-00027-1
Original Article

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

Author information +
History +
PDF

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.

Cite this article

Download citation ▾
Yanqiong Zhang, Chaoqun Liu, Yu-Ping Tian. Distributed constrained aggregative games of uncertain Euler-Lagrange systems under unbalanced digraphs. Autonomous Intelligent Systems, 2022, 2(1): 9 DOI:10.1007/s43684-022-00027-1

登录浏览全文

4963

注册一个新账户 忘记密码

References

Funding

National Natural Science Foundation of China,(61703368)

Natural Science Foundation of Zhejiang Province,(LZ21F030002)

AI Summary AI Mindmap
PDF

246

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/