Scalable Online Planning for Multi-Agent MDPs
From MaRDI portal
Publication:5076326
Recommendations
- Probabilistic inference techniques for scalable multiagent decision making
- Online planning for multi-agent systems with bounded communication
- Incremental clustering and expansion for faster optimal planning in decentralized POMDPs
- Optimally solving Dec-POMDPs as continuous-state MDPs
- Decentralized MDPs with sparse interactions
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 1946845 (Why is no real title available?)
- scientific article; zbMATH DE number 2000828 (Why is no real title available?)
- scientific article; zbMATH DE number 7306875 (Why is no real title available?)
- A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
- A survey of multi-agent formation control
- Bucket elimination: A unifying framework for reasoning
- Decision making under uncertainty. Theory and application. With contributions from Christopher Amato, Girish Chowdhary, Jonathan P. How, Hayley J. Davison Reynolds, Jason R. Thornton, Pedro A. Torres-Carrasquillo, N. Kemal Üre and John Vian
- Dynamic programming and optimal control. Vol. 1.
- Efficient large-scale multi-drone delivery using transit networks
- Enhancements for multi-player Monte-Carlo tree search
- Julia: a fresh approach to numerical computing
- Multi-agent reinforcement learning: a selective overview of theories and algorithms
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
- Probabilistic graphical models.
- Reinforcement learning. An introduction
Cited in
(5)
This page was built for publication: Scalable Online Planning for Multi-Agent MDPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076326)