DocumentCode
115146
Title
Model-free adaptive learning solutions for discrete-time dynamic graphical games
Author
Abouheaf, Mohammed I. ; Lewis, Frank L. ; Mahmoud, Magdi S.
Author_Institution
Syst. Eng., King Fahd Univ. of Pet. & Miner. (KFUPM), Dhahran, Saudi Arabia
fYear
2014
fDate
15-17 Dec. 2014
Firstpage
3578
Lastpage
3583
Abstract
This paper introduces novel model-free adaptive learning algorithm to solve the dynamic graphical games in real-time. It allows online model-free tuning of the controller and critic networks. This algorithm solves the dynamic graphical game in a distributed fashion. Novel coupled Bellman equations and Hamiltonian functions are developed for the dynamic graphical games. Nash solution for the dynamic graphical game is given in terms of the solution to a set of coupled Hamilton-Jacobi-Bellman equations developed herein. An online model-free policy iteration algorithm is developed to learn the Nash solution for the dynamic graphical game in real-time. A proof of convergence for this algorithm is given under mild assumptions about the inter-connectivity properties of the graph.
Keywords
convergence of numerical methods; discrete time systems; game theory; iterative methods; learning (artificial intelligence); mathematics computing; Hamiltonian functions; Nash solution; controller networks; convergence; coupled Hamilton-Jacobi-Bellman equations; critic networks; discrete-time dynamic graphical games; interconnectivity properties; model-free adaptive learning algorithm; online model-free policy iteration algorithm; online model-free tuning; Equations; Games; Heuristic algorithms; Integrated circuits; Mathematical model; Optimal control; Synchronization;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on
Conference_Location
Los Angeles, CA
Print_ISBN
978-1-4799-7746-8
Type
conf
DOI
10.1109/CDC.2014.7039945
Filename
7039945
Link To Document