Multi-threading parallel reinforcement learning

Abstract

With respect to the problem of the slow convergence of the traditional reinforcement learning algorithm in practical applications, we propose a novel multi-threading parallel reinforcement learning algorithm - MPRL. MPRL is mainly composed of two parts. One is the FCM-based reinforcement learning multi-threading partitioning method, which transforms the multi-threading partitioning problem into a clustering partition problem to obtain the optimal multi-threading partitioning solution. The other is the parallel reinforcement learning framework, which makes the parallel execution between the policy evaluation and the interaction with the environment. In the learning process, the experience replay is adopted to update the value function, which can also solve the problem of the non-convergence in the off-policy evaluation. Experimentally, the MPRL algorithm is applied to the windy grid world problem and the cart pole problem, and compared with Q-Learning, Sarsa and KCACL. The experimental results show that MPRL has a faster convergence rate and better convergence performance.