Q-learning is a reinforcement learning method for solving Markov decision problems with incomplete information proposed by Watkins. With the development of reinforcement learning, more and more Q-learning related algorithms have been proposed, and their application range has become wider. In this paper, we discussed single agent algorithms including basic Q learning, deep Q learning and double Q learning. In addition, we discussed multi-agent algorithms including modular Q learning, ant Q learning and Nash Q learning with prominent characteristics. This paper will compare their advantages and disadvantages, and put forward our own views on the current application of Q-learning and the future trend of Q-learning.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.