Abstract

In dynamic graphical games, in order to obtain the optimal strategy for each agent, the traditional method is to solve a set of coupled HJB equations. It is very difficult to solve such problems by traditional methods, especially the input of each agent is constrained. Actor-critic is a reinforcement learning method that can solve such problems through online iteration. This paper proposes an online iterative algorithm for solving linear discrete-time systems graphics games with input constraints, and this algorithm without the need for drift dynamics of agents. Each agent needs two neural networks to fit the agent’s value function and control strategy, respectively. Finally, a simulation example is given to show the effectiveness of our method.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.