Efficient Multiagent Planning via Shared Action Suggestions
Dylan M. Asmar, Mykel J. Kochenderfer
Abstract
Decentralized partially observable Markov decision processes with communication (Dec-POMDP-Com) provide a framework for multiagent decision making under uncertainty, but the NEXP-complete complexity for finite-horizon problems renders solutions intractable in general. While sharing actions and observations can reduce the complexity to PSPACE-complete, we propose an approach that bridges POMDPs and Dec-POMDPs by communicating only suggested joint actions, eliminating the need to share observations while retaining near-centralized performance. Our algorithm estimates joint beliefs using shared actions to prune infeasible beliefs. Each agent maintains possible belief sets for other agents, pruning them based on suggested actions to form an estimated joint belief usable with any centralized policy. This approach requires solving a POMDP for each agent, reducing computational complexity while preserving performance. We demonstrate its effectiveness on several Dec-POMDP benchmarks, showing performance comparable to centralized methods when shared actions enable effective belief pruning. This action-based communication framework offers a natural avenue for integrating human-agent cooperation, opening new directions for scalable multiagent planning under uncertainty, with applications in both autonomous systems and human-agent teams.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e18844cc-3fe4-4632-a356-d1de6283a88bBuilds on2
Related papers
- Multi-agent active perception with prediction rewardsMikko Lauri, Frans A. OliehoekNeurIPS 2020 · 13 citations
- Factored Online Planning in Many-Agent POMDPsMaris F. L. Galesloot, Thiago D. Simão, Sebastian Junges, Nils JansenAAAI 2024 · 3 citations
- Optimally Solving Two-Agent Decentralized POMDPs Under One-Sided Information SharingYuxuan Xie, Jilles Dibangoye, Olivier BuffetICML 2020 · 15 citations
- Online POMDP Planning with Anytime Deterministic GuaranteesMoran Barenboim, Vadim IndelmanNeurIPS 2023 · 13 citations
- Scalable Solution Methods for Dec-POMDPs with Deterministic DynamicsYang You, Alex Schutz, Zhikun Li, Bruno Lacerda et al.AAAI 2026
