Scalable Solution Methods for Dec-POMDPs with Deterministic Dynamics
Yang You, Alex Schutz, Zhikun Li, Bruno Lacerda, Robert Skilton, Nick Hawes
Abstract
Many high-level multi-agent planning problems, such as multi-robot navigation and path planning, can be modeled with deterministic actions and observations. In this work, we focus on such domains and introduce the class of Deterministic Decentralized POMDPs (Det-Dec-POMDPs)—a subclass of Dec-POMDPs with deterministic transitions and observations given the state and joint actions. We then propose a practical solver, Iterative Deterministic POMDP Planning (IDPP), based on the classic Joint Equilibrium Search for Policies framework, specifically optimized to handle large-scale Det-Dec-POMDPs that existing Dec-POMDP solvers cannot handle efficiently.
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 d0d1e0f6-464d-47c6-9701-b792e801066cRelated papers
- Improved Knowledge Modeling and Its Use for Signaling in Multi-Agent Planning with Partial ObservabilityShashank Shekhar, Ronen I. Brafman, Guy ShaniAAAI 2021 · 5 citations
- Efficient Multiagent Planning via Shared Action SuggestionsDylan M. Asmar, Mykel J. KochenderferAAAI 2026
- Reference-Based POMDPsEdward Kim, Yohan Karunanayake, Hanna KurniawatiNeurIPS 2023 · 5 citations
- Multi-agent active perception with prediction rewardsMikko Lauri, Frans A. OliehoekNeurIPS 2020 · 13 citations
- Multi-Agent Determinantal Q-LearningYaodong Yang, Ying Wen, Jun Wang, Liheng Chen et al.ICML 2020 · 83 citations
