Sep 2026· IEEE Transactions on Neural Networks and Learning Systems· Vol PP· 0 citations
Medicine
TL;DR
This work proposes a multiagent belief state computation method termed mutual awareness belief (MAB), which extends belief modeling to decentralized partially observable settings by incorporating agents' behavioral intentions and collaborative relationships and proves effective in the nonmonotonic Pursuit environment.
Abstract
In multiagent reinforcement learning (MARL), agents engage in collaborative or competitive interactions, adapting their policies to maximize rewards. However, in environments with only team rewards, agents cannot accurately perceive the rewards obtained from their individual actions. To address this limitation, we propose a multiagent belief state computation method termed mutual awareness belief (MAB). MAB extends belief modeling to decentralized partially observable settings by incorporating agents' behavioral intentions and collaborative relationships. This allows each agent to infer the contribution of individual behaviors to team rewards during decision-making and supports team-advantageous joint decisions. In addition, to address the issue of information lag, we develop progressive graph construction (PGC), a novel module for computing MAB. PGC constructs a dynamic graph with progressively updated node features and cooperation-informed edge weights. Through interaction with PGC, agents iteratively update and retrieve graph information to derive the MAB. Empirical results show that our method achieves competitive performance against baseline approaches on the StarCraft unit micromanagement benchmark and proves effective in the nonmonotonic Pursuit environment.
This work introduces HySTAR, a MAPPO-based framework that separates adaptive representation learning from a temporally consistent high-order value-decomposition basis, and demonstrates consistent improvements over MAPPO-style, value-factorization, and dynamic-grouping baselines.
Xing-Long Luo, Yu-Ding Zhang, Yu-Heng Kuang et al.· 0 citations
Efficient exploration remains a key challenge in cooperative multi-agent reinforcement learning (MARL), where the novelty of a joint situation may arise not only from unfamiliar individual observations but also from previously underrepresented interaction patterns among agents. Existing intrinsic-reward approaches comm...
Ya-Xin Xu, Yin-Xiang He, Tian-Yi Liu et al.· Applied Informatics· 0 citations
The findings demonstrate that combining relational state representations, copula-based dependence modeling, and shared rewards improves coordination, robustness, and stability in multi-agent navigation tasks.
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.
Shuo Liu, Xinzichen Li, Tian-Le Chen et al.· 0 citations
Action Generation with Topology Awareness (AGTA), a topology-aware sequential decision-making framework in MARL that integrates inter-agent correlation modeling with topology-guided decision-order optimization, and outperforms the state-of-the-art counterparts.
Kun Hu, Shanghua Wen, Wen-Di Wu et al.· Mathematics· 0 citations
MAGIC, a dense-reward reinforcement learning framework for mixed-granularity graph generation, outperforms state-of-the-art baselines across eight benchmarks and demonstrates strong inference efficiency in the efficiency study.
Kai-Rui Yang, Zi-Heng Yi, Xun-Kai Li et al.· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comOct 29, 2026
Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.