Communication-based decomposition mechanisms for decentralized MDPS

MaRDI QIDQ3624131zbMATH OpenFDO

Authors Claudia V. Goldman, Shlomo Zilberstein

Publication date 28 April 2009

Full work available at URL https://arxiv.org/abs/1111.0065

zbMATH Keywords

Markov decisionmulti-agent planningstochastic environments

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 5547972
• Online planning for multi-agent systems with bounded communication
• scientific article; zbMATH DE number 2243376
• scientific article; zbMATH DE number 2243368
• Optimally solving Dec-POMDPs as continuous-state MDPs

Cited in

(4)

• Multi-robot inverse reinforcement learning under occlusion with estimation of state transitions
• Decentralized Markov decision processes for handling temporal and resource constraints in a multiple robot system
• What to communicate? Execution-time decision in multi-agent POMDPs
• scientific article; zbMATH DE number 2243368 (Why is no real title available?)

This page was built for publication: Communication-based decomposition mechanisms for decentralized MDPS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624131)