Policy iteration and coupled Riccati solutions for dynamic graphical games
by Mohammed I. Abouheaf; Magdi Sadek Mahmoud
International Journal of Digital Signals and Smart Systems (IJDSSS), Vol. 1, No. 2, 2017

Abstract: A novel online adaptive learning technique is developed to solve the dynamic graphical games in real-time. The players or agents exchange the information on a communication graph. Hamiltonian mechanics are used to derive the constrained minimum conditions for the graphical game. Novel coupled Riccati equations are developed for this type of games. Convergence of the adaptive learning technique is studied given the graph topology. Nash equilibrium solution for the graphical game is found by solving the underlying Hamilton-Jacobi-Bellman equations. Actor-Critic neural network structures are used to implement the adaptive learning solution using local information available to the players.

Online publication date: Mon, 20-Nov-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Digital Signals and Smart Systems (IJDSSS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com