Opinion

Adaptive State Approximation for Multi-Agent RL in Sparse Reward Scenarios

Archive editionIngrid SørensenNov 15, 2024· 17,725 views

A new algorithm uses state similarity to guide exploration in sparse-reward multi-agent tasks, outperforming existing methods in predator-prey simulations.

In context

By late 2024, multi-agent reinforcement learning (MARL) had become a key enabler for coordinated robotic systems, yet sparse reward environments—where feedback is rare—remained a major bottleneck. Training agent teams in such scenarios often led to inefficient exploration and slow convergence, limiting real-world deployment in manufacturing and logistics. This paper, published in the Chinese journal Robot, addressed that challenge with a novel approach inspired by human learning.

What was reported

Researchers from Hefei University of Technology and the Civil Aviation Flight University of China proposed a multi-agent reinforcement learning algorithm based on adaptive state approximation (MAASA). The method operates under a centralized training with decentralized execution (CTDE) framework. It maintains a candidate state set that records the best local states encountered during exploration, dynamically updating it based on state-action value estimates.

MAASA computes similarity between states using the cosine similarity of their state-action value vectors. When a current local state closely matches a candidate state, the algorithm uses the distance between them as an intrinsic reward, guiding agents to explore unknown areas more effectively while maximizing joint state-action values. This mechanism mimics how humans recognize similar situations to learn under scarce feedback.

Experiments in multi-agent predator-prey environments with varying reward sparsity showed that MAASA outperformed existing reinforcement learning methods. The algorithm demonstrated robustness and effectiveness, accelerating learning speed and enabling agents to find optimal strategies faster than baselines.

Why it mattered

For industrial automation, MAASA offered a practical path to train coordinated robot teams—such as those in warehouse picking or autonomous inspection—where explicit rewards are rare. By improving exploration efficiency in sparse-reward settings, the approach could reduce training time and enhance adaptability in dynamic, real-world environments, making MARL more viable for complex manufacturing tasks.

“By considering the similarity among the agent states, the algorithm automatically obtains approximate states from the replay buffer to fill the candidate state set, and uses the exploration information in the candidate state set to promote the training of strategies.”

Source: 《机器人》期刊 (robot.sia.cn) · Published 2024-11-15 · “稀疏奖励场景下基于适应性状态近似的多智能体强化学习”