Efficient Multiagent Planning via Shared Action Suggestions
Dylan M. Asmar, Mykel J. Kochenderfer

TL;DR
This paper introduces a scalable multiagent planning method that uses shared action suggestions to efficiently prune beliefs, bridging POMDPs and Dec-POMDPs, and achieving near-centralized performance.
Contribution
It proposes a novel approach that communicates only suggested joint actions, reducing complexity while maintaining high performance in multiagent decision making.
Findings
Performance comparable to centralized methods on benchmarks
Reduces computational complexity by solving individual POMDPs
Enables effective belief pruning through shared actions
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsSemantic Web and Ontologies · AI-based Problem Solving and Planning · Logic, Reasoning, and Knowledge
