Home /Research /Multi-Agent Reinforcement Learning Based on K-Means Clustering in Multi-Robot Cooperative Systems
SWARM

Multi-Agent Reinforcement Learning Based on K-Means Clustering in Multi-Robot Cooperative Systems

Chang An Liu, Fei Liu, Chun Yang Liu, Hua Wu

Year
2011
Citations
4

Abstract

To solve the curse of dimensionality problem in multi-agent reinforcement learning, a learning method based on k-means is presented in this paper. In this method, the environmental state is represented as key state factors. The state space explosion is avoided by classifying states into different clusters using k-means. The learning rate is improved by assigning different states to existent clusters, as well as corresponding strategy. Compared to traditional Q-learning, our experimental results of the multi-robot cooperation show that our scheme improves the team learning ability efficiently. Meanwhile, the cooperation efficiency can be enhanced successfully.

Keywords

Reinforcement learningCurse of dimensionalityCluster analysisRobotComputer scienceArtificial intelligenceKey (lock)State spaceState (computer science)Q-learning

Related papers

Browse all SWARM papers