A Ranking Scheme for Trust Region Multi-agent Reinforcement Learning

In multi-agent reinforcement learning (MARL), trust region (TR) methods are widely used because they effectively mitigate the nonstationarity of multi-agent systems and facilitate collaboration among diverse agent types. Based on the multi-agent advantage decomposition lemma, TR methods adopt a sequential update scheme (i.e., agents’ policy networks are trained with a certain order). However, current TR methods lack a ranking scheme and train the agents in a random order, this results in suboptimal performance and large variances. To solve this issue, based on agents’ observations (the input of agents’ policy networks), we formulate our ranking criteria and furthermore propose our ranking schemes. Specifically, we avoid agents with similar observations being ranked adjacent to each other for training and give higher priority to the agents with more information in their observations. We extend our schemes to popular TR methods and evaluate them on a series of StarCraftII, Google Football and Multi-Agent MuJoCo tasks, results show that our ranking schemes can enhance current TR methods in many tasks, whatever in performance, efficiency or stability, indicating its modeling capability on both homogeneous and heterogeneous agent tasks.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10889127
Primary Topic
Reinforcement Learning in Robotics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Ranking Scheme for Trust Region Multi-agent Reinforcement Learning

Haiqi Zhu, Yi Hu, Feng Jiang, Ruichen Gao et al.
Reinforcement Learning in Robotics
article

A Ranking Scheme for Trust Region Multi-agent Reinforcement Learning

Haiqi Zhu, Yi Hu, Feng Jiang, Ruichen Gao, Mengxuan Shao, Wei Zhang, Dingchang Zheng, Chenyue Song
article en

Abstract

In multi-agent reinforcement learning (MARL), trust region (TR) methods are widely used because they effectively mitigate the nonstationarity of multi-agent systems and facilitate collaboration among diverse agent types. Based on the multi-agent advantage decomposition lemma, TR methods adopt a sequential update scheme (i.e., agents’ policy networks are trained with a certain order). However, current TR methods lack a ranking scheme and train the agents in a random order, this results in suboptimal performance and large variances. To solve this issue, based on agents’ observations (the input of agents’ policy networks), we formulate our ranking criteria and furthermore propose our ranking schemes. Specifically, we avoid agents with similar observations being ranked adjacent to each other for training and give higher priority to the agents with more information in their observations. We extend our schemes to popular TR methods and evaluate them on a series of StarCraftII, Google Football and Multi-Agent MuJoCo tasks, results show that our ranking schemes can enhance current TR methods in many tasks, whatever in performance, efficiency or stability, indicating its modeling capability on both homogeneous and heterogeneous agent tasks.

Harbin Institute of Technology (CN)
Openalex Percentile: Top 98%
Reinforcement Learning in Robotics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Ranking Scheme for Trust Region Multi-agent Reinforcement Learning — Haiqi Zhu, Yi Hu, et al. · (2025) | TGRS Research Map | TGRS