Sep 2026· International Journal of Innovative Science and Research Technology· 0 citations· 26 references
Reinforcement Learning in Robotics
TL;DR
The obstacles that distinguish MARL from its singleagent counterpart are discussed, namely a moving-target learning problem, the difficulty of dividing a shared reward among team members, limited local views, and growth of the joint action space, and why training with global information but acting on local information has become the standard design.
Abstract
When several self-directed learners share one environment, each must improve its own behavior while the others
are also changing theirs. This is the setting studied by multi-agent reinforcement learning (MARL), and the agents involved
may be working toward one goal, pulling in opposite directions, or some combination of the two. In this review we first lay
out the mathematical objects used to describe such interaction, namely Markov games and their decentralized, partially
observed variants, and then group the algorithmic literature into three lineages: agents that learn in isolation, methods that
factor a team value into per-agent pieces (VDN, QMIX and their descendants), and actor-critic schemes that train against a
critic with global knowledge (MADDPG, COMA, MAPPO). We discuss the obstacles that distinguish MARL from its singleagent counterpart, namely a moving-target learning problem, the difficulty of dividing a shared reward among team
members, limited local views, and growth of the joint action space, and explain why training with global information but
acting on local information has become the standard design. Uses of MARL in real-time strategy games, robot teams,
automated vehicles, wireless resource sharing, and the orchestration of language-model agents are reviewed alongside the
test suites the community relies on. We close by pointing to unresolved questions concerning scale, cooperation with
unfamiliar partners, and deployment safety.
The integration of reinforcement learning (RL) into the optimization of multi-agent collaboration for Large Language Models (LLMs) is an important combination of two advanced areas, Multi-Agent Systems (MAS) and LLMs. This paper thoroughly examines the main approaches, evaluation standards, recent progress and existing...
Qian-Ling Zhang· Applied and Computational En...· 0 citations
This work instantiates MAPL using MARL from human feedback with a learned reward model and multi-agent direct preference optimization (MADPO), and shows that MAPL can improve collaboration quality and efficiency while approaching the performance of MARL with fixed, well-defined rewards.
Isolated Bilateral Reinforcement Learning (IB-RL), in which the two roles coevolve through joint rollouts while each role optimizes its own reward through fully independent advantages, action masks, and update paths, produces policies that generalize more effectively to unseen counterparts.
Senhao Wang, Chenghao Cai, Hai-Tao Hu et al.· 0 citations
Training LLM-based multi-agent systems with multi-agent reinforcement learning with multi-agent reinforcement learning is rapidly gaining traction, and a parallel line of work argues that such systems should be judged by their behavior, not only their reward.
This framework exposes the gap between rewarded partial completion and realized cooperation by certifying what cooperation successful completion requires and using temporal cooperation graphs to reveal what policies exhibit.
Yannick Molinghen, Hugo Charels, Tom Lenaerts· 0 citations
This paper introduces Multi-AGent Preference-Integrated lEarning (MAGPIE), a framework that leverages agent-specific preference signals in the multi-agent learning process and can derive Nash equilibrium solutions.
Ni Mu, Yao Luan, Yiqin Yang et al.· IEEE Transactions on Automat...· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduNov 17, 2026
By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.
MIT News · Artificial Intelligence· news.mit.eduNov 17, 2026
AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduNov 9, 2026