期刊
AUTOMATICA
卷 99, 期 -, 页码 246-252出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2018.10.041
关键词
Aggregative games; Nash equilibrium; Cyber-physical systems; Euler-Lagrange systems
资金
- National Key Research and Development Program of China [2016YFB0901902]
- NSFC, China [61733018, 61333001, 61573344, 61803385]
- Fundamental Research Funds for the China Central Universities of USTB [FRF-TP-17-088A1]
In this paper, an aggregative game of Euler-Lagrange (EL) systems is investigated, where the cost functions of all players depend on not only their own decisions but also the aggregate of all decisions. Two distributed algorithms are designed for these heterogeneous EL players to reach the Nash equilibrium of aggregative games. By constructing suitable Lyapunov functions, the convergence of the two algorithms are analyzed. The first algorithm achieves globally exponential convergence without parameter uncertainty, and the other achieves globally asymptotic convergence, even in the presence of uncertain parameters. Numerical examples are given to illustrate the effectiveness of the methods. (C) 2018 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据