Optimal distributed learning for disturbance rejection in networked non-linear games under unknown dynamics

25Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

In this study, an online distributed optimal adaptive algorithm is introduced for continuous-time non-linear differential graphical games under unknown systems subject to external disturbances. The proposed algorithm learns online the approximate solution to the coupled Hamilton–Jacobi–Isaacs equations. Each of the players in the game uses an actor-critic network structure and an intelligent identifier to find the unknown parameters of the systems. The authors use recorded past observations concurrently with current data to speed up convergence by exploring the state space. The closed-loop stability and convergence of the policies to Nash equilibrium are ensured by using Lyapunov stability theory. Finally, a simulation example shows the efficiency of the proposed algorithm.

Cite

CITATION STYLE

APA

Tatari, F., Vamvoudakis, K. G., & Mazouchi, M. (2019). Optimal distributed learning for disturbance rejection in networked non-linear games under unknown dynamics. IET Control Theory and Applications, 13(17), 2838–2848. https://doi.org/10.1049/iet-cta.2018.5832

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free