SCC-rFMQ: a multiagent reinforcement learning method in cooperative Markov games with continuous actions

  • Chengwei Zhang
  • , Zhuobing Han
  • , Bingfu Liu
  • , Wanli Xue
  • , Jianye Hao
  • , Xiaohong Li
  • , Dou An
  • , Rong Chen

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

Although many multiagent reinforcement learning (MARL) methods have been proposed for learning the optimal solutions in continuous-action domains, multiagent cooperation domains with independent learners (ILs) have received relatively few investigations, especially in traditional RL domain. In this paper, we propose an sample based independent learning method, named Sample Continuous Coordination with recursive Frequency Maximum Q-Value (SCC-rFMQ), which divides the multiagent cooperative problem with continuous actions into two layers. The first layer samples a finite set of actions from the continuous action spaces by a re-sampling mechanism with variable exploratory rates, and the second layer evaluates the actions in the sampled action set and updates the policy using a reinforcement learning cooperative method. By constructing cooperative mechanisms at both levels, SCC-rFMQ can handle cooperative problems in continuous action cooperative Markov games effectively. The effectiveness of SCC-rFMQ is experimentally demonstrated on two well-designed games, i.e., a continuous version of the climbing game and a cooperative version of the boat problem. Experimental results show that SCC-rFMQ outperforms other reinforcement learning algorithms.

Original languageEnglish
Pages (from-to)1927-1944
Number of pages18
JournalInternational Journal of Machine Learning and Cybernetics
Volume13
Issue number7
DOIs
StatePublished - Jul 2022

Keywords

  • Continuous action space
  • Cooperative Markov games
  • Multiagent learning
  • Reinforcement learning

Fingerprint

Dive into the research topics of 'SCC-rFMQ: a multiagent reinforcement learning method in cooperative Markov games with continuous actions'. Together they form a unique fingerprint.

Cite this