Wasserstein-Barycenter Consensus for Cooperative Multi-Agent Reinforcement Learning
원문 초록
Cooperative multi-agent reinforcement learning (MARL) demands principled mechanisms to align heterogeneous policies while preserving the capacity for specialized behavior. We introduce a novel consensus framework that defines the team strategy as the entropic-regularized $p$-Wasserstein barycenter of agents' joint state--action visitation measures. By augmenting each agent's policy objective with a soft penalty proportional to its Sinkhorn divergence from this barycenter, the proposed approach encourages coherent group behavior without enforcing rigid parameter sharing. We derive an algorithm that alternates between Sinkhorn-barycenter computation and policy-gradient updates, and we prove that, under standard Lipschitz and compactness assumptions, the maximal pairwise policy discrepancy contracts at a geometric rate. Empirical evaluation on a cooperative navigation case study demonstrates that our OT-barycenter consensus outperforms an independent learners baseline in convergence speed and final coordination success.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Biological Pathway Guided Gene Selection Through Collaborative Reinforcement Learning
Artificial Generals Intelligence: Mastering Generals.io with Reinforcement Learning
Multi-Agent Reinforcement Learning for Autonomous Multi-Satellite Earth Observation: A Realistic Case Study
Dynamic Reinsurance Treaty Bidding via Multi-Agent Reinforcement Learning
Decentralizing Multi-Agent Reinforcement Learning with Temporal Causal Information
Action Dependency Graphs for Globally Optimal Coordinated Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.